Networks and Paths (HSC SSCE Mathematics Standard): Flashcards
📚Flashcards
Practise the cards
10 cards from this deck
ShowHide
Practise the cards
10 cards from this deck
Definition of shortest path
Definition of shortest path
Route where sum of edge weights is minimised
Weights representing time help find what?
Weights representing time help find what?
Quickest route to travel
Weights representing distance help find what?
Weights representing distance help find what?
Route covering least distance
Why might shortest distance not be fastest route?
Why might shortest distance not be fastest route?
Speed limits vary on different routes
Method of inspection steps
Method of inspection steps
List paths, calculate weights, compare totals
Can there be multiple shortest paths?
Can there be multiple shortest paths?
Yes, multiple paths can have same minimum weight
Must shortest path visit all vertices?
Must shortest path visit all vertices?
No, it might not go through all vertices
How to save time finding shortest path?
How to save time finding shortest path?
Eliminate obviously inefficient routes
How is shortest path identified?
How is shortest path identified?
Path with smallest sum of edge weights
Why check all reasonable routes?
Why check all reasonable routes?
Don't guess - shortest may not be obvious