How do you decide which vertex to start from on an initial matching? Sometimes there are two free on the left side and it's not always obvious which one to start from
Either, there are multiple ways to solve matchings
Me too but i'd say its a 90% chance really they always have a question on linear programming i think, i really hope this ones the exception and doesnt have it on ha
I really really hope so LOL & if it does I just hope it's not worth a lot of marks
When doing the early and late time, for the early time you pick the latest time and when doing a backward pass for the late time you pick the shortest late time, right?
When doing the early and late time, for the early time you pick the latest time and when doing a backward pass for the late time you pick the shortest late time, right?
Either, there are multiple ways to solve matchings
But for example, Jan 2009 Question 4a, you could start from B or F but the mark scheme wants the path from B, how would I know which to choose in that example?
But for example, Jan 2009 Question 4a, you could start from B or F but the mark scheme wants the path from B, how would I know which to choose in that example?
Someone correct me if I'm wrong but I think that's because F can only go to 6, and in the initial matching E is already at 6
But for example, Jan 2009 Question 4a, you could start from B or F but the mark scheme wants the path from B, how would I know which to choose in that example?
it doesnt matter which one you start from, it mentions on the mark scheme that it accepts b to 5 with the correct path etc
But for example, Jan 2009 Question 4a, you could start from B or F but the mark scheme wants the path from B, how would I know which to choose in that example?
The mark scheme gives an example of one of the solutions.
There are multiple answers. You are probably right with your solution, ask a teacher to check?
But for example, Jan 2009 Question 4a, you could start from B or F but the mark scheme wants the path from B, how would I know which to choose in that example?
If you connected F to 6, and then E to 1, then D would be left unmatched, which means that it is not an improved matching, so you have to start at B to get an improved matching.
Yeah I'll do that. Maybe the mark scheme I have isn't the complete one. The only solution it gives is from B to 5 and none from F. Normally they have eg next to them when theres more solutions elsewhere in the mark scheme. Thanks
If you connected F to 6, and then E to 1, then D would be left unmatched, which means that it is not an improved matching, so you have to start at B to get an improved matching.
its just the definitions that i havent learnt. no point revising them all if they will hardly come up. i only know the definition of tree, spanning tree, bipartite graph, connected graph,
its just the definitions that i havent learnt. no point revising them all if they will hardly come up. i only know the definition of tree, spanning tree, bipartite graph, connected graph,
I hope they give a definition and you give the name rather than me try and remember the definitions haha