The Route Inspection Problem (AQA A-Level Further Maths): Flashcards
📚Flashcards
Practise the cards
10 cards from this deck
ShowHide
Practise the cards
10 cards from this deck
Route inspection problem objective
Route inspection problem objective
Shortest route along every arc, returning to start
Alternative name for route inspection problem
Alternative name for route inspection problem
Chinese postman problem
Eulerian network definition
Eulerian network definition
Travel every arc exactly once and return to start
Condition for Eulerian network
Condition for Eulerian network
All nodes have even degree
Degree of a node
Degree of a node
Number of arcs connected to it
How many odd-degree nodes in any network?
How many odd-degree nodes in any network?
Always an even number
Number of pairings for 4 odd nodes
Number of pairings for 4 odd nodes
3 pairings
Total route length formula
Total route length formula
Original arc weights + extra arc weights
Route passes through node of degree how many times?
Route passes through node of degree how many times?
times
Semi-Eulerian network definition
Semi-Eulerian network definition
Exactly two nodes of odd degree