Connector Problems and Shortest Path (HSC SSCE Mathematics Standard): Flashcards

📚Flashcards
Connector Problems and Shortest Path
Sign up to keep revising.Create a free account to study more flashcards and track your progress.

Practise the cards

10 cards from this deck

Show

Connector problem

Finding economical way to link all locations in network

Tool used for connector problems

Minimum spanning trees

Minimum spanning tree meaning

Smallest total weight connecting all vertices

Connector problems: key characteristic

All vertices connected with minimum cost

Algorithm for connector problems

Prim's algorithm

Shortest path

Route between 2 vertices with minimized edge weight sum

Connector vs shortest path difference

All vertices vs two specific vertices

Multiple shortest paths possible?

Yes, paths can have same minimum length

Method of inspection steps

List routes, calculate lengths, compare

Shortest distance = shortest time?

No, speed limits affect time differently

Join 100,000+ SSCE students studying Flashcards with us.

Select your subjects, and get access to A+ resources today.