See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
12 cards from this deck
Find shortest path from source node to all other nodes
Non-negative edge weights
0
Infinity (∞\infty∞)
Greedy algorithm
O(V2)O(V^2)O(V2)
O((V+E)logV)O((V + E) \log V)O((V+E)logV)
O(V+E)O(V + E)O(V+E)
No
After all neighbours are evaluated
Priority queue
Unvisited node with smallest known distance
Select your subjects, and get access to A+ resources today.