See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
12 cards from this deck
A method to find the shortest path between nodes in a weighted graph
Distance, time, or cost
Numbers on edges connecting nodes
GPS, network routing, transport planning, emergency services
000
Choose smallest working value
Node, order, final value, working values
Work backwards using 'came from' data
After completing a node, for connected nodes
Shortest distance from start node
All nodes completed
Keep smallest working value
Select your subjects, and get access to A+ resources today.