The Route Inspection Problem (AQA A-Level Further Maths): Quizzes
📚Quizzes
Practise the questions
10 questions from this quiz
ShowHide
Practise the questions
10 questions from this quiz
What does the route inspection problem aim to find?
What does the route inspection problem aim to find?
Shortest route along every arc at least once
When is a network Eulerian (traversable)?
When is a network Eulerian (traversable)?
When all nodes have even degree
A node has 3 regular arcs and 1 loop. What is its degree?
A node has 3 regular arcs and 1 loop. What is its degree?
Why do even-degree nodes allow traversable routes?
Why do even-degree nodes allow traversable routes?
Arcs used in pairs: one to enter, one out
How many odd-degree nodes can a network have?
How many odd-degree nodes can a network have?
Always an even number
With 4 odd nodes, how many possible pairings exist?
With 4 odd nodes, how many possible pairings exist?
pairings
How is total route length calculated?
How is total route length calculated?
Original arc weights + extra arc weights
How many pairings exist for a network with 6 odd nodes?
How many pairings exist for a network with 6 odd nodes?
pairings
A node has degree 8. How many times does the inspection route pass through it?
A node has degree 8. How many times does the inspection route pass through it?
times
What defines a semi-Eulerian network?
What defines a semi-Eulerian network?
Exactly two nodes of odd degree