See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Finds most efficient route between points in a network
Edsger Dijkstra in 1959
Graph (with vertices/nodes and edges)
Weighted graph with positive weights only
Only works with positive edge weights
Calculates shortest path from one start vertex to all others
Always move to nearest unvisited vertex
Always keep the shortest distance
Two-dimensional array (adjacency matrix)
Show which vertex you travelled from to reach current distance
Select your subjects, and get access to A+ resources today.