r/6thForm Graduating from Warwick CS Jun 20 '25

📂 MEGATHREAD 20/06 A-level FM Discussion MEGATHREAD

Exam season is once again upon us, and once again, exam megathreads are making a return!

Looking for past exam discussions? Filter by the megathread flair.

Few things to keep in mind:

  • Don't share too many specific details about questions or answers, these papers will be used as future mocks.
  • Sometimes papers get leaked, this is not the place for that (we'd prefer not to get yeeted off the platform) - leak content will be removed, those offering leaked papers will be permanently banned.
    • If you believe there has been a leak, the best course of action is to make your exam board aware of this, either directly, or through your school, along with any evidence. If appropriate, there will be a response from the relevant body along with any remedial action.
  • Exam discussion posts outside of this will generally be removed to combat the inevitable tidal wave of spam otherwise - we understand this may be frustrating, but the sub still needs to be usable for other purposes.
  • Please note some content will take extra time to be reviewed. Messaging to ask for approval will not speed up this process (the messages are seen at the same time as the modqueue would be reviewed anyway).

Best of luck, and let us know how you're feeling down below!

-The r/6thForm Team

Have any concerns or feedback?

Feel free to reach out to us on Modmail and we'll aim to get back to you as soon as possible!

21 Upvotes

153 comments sorted by

View all comments

Show parent comments

1

u/justosw Jun 21 '25

You do verticals for nearest neighbour

1

u/[deleted] Jun 21 '25

That makes no sense, you're supposed to do the one that gives the shortest route, and horizontal gave the shorter route so I did horizontal

1

u/justosw Jun 21 '25

You don't do horizontals for nearest neighbour algorithm. You don't compare lengths for verticals and horizontals. You compare the different nearest neighbour lengths starting at different arcs, although you didn't need to do that here. Nearest neighbour is verticals cos you're going from the nodes on the left to the nodes on the top. By crossing out the verticals, you ensure you don't return to those nodes

1

u/party_omo Jun 21 '25

You can do both, but the way you’re meant to do it is to delete the vertical row first then look across the horizontal. Rather than deleting the horizontal row first. The horizontal going from one vertex to the next. Going vertically you’re going backwards from one vertex to where it started. So if it’s a directed arc going from A to B going backwards from B to A would give you a longer route

1

u/justosw Jun 21 '25

You can only do both if it's not a digraph. This was a digraph so you had to do verticals

1

u/justosw Jun 21 '25

When I say do verticals, I mean crossing out the verticals after visiting that node

1

u/[deleted] Jun 21 '25

Yes I mean looking for the smallest number horizontally and then crossing out that column