See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Find shortest path through weighted graph
Edsger Wybe Dijkstra (Dutch computer scientist)
0 (zero)
Cannot be changed once circled
The smallest uncircled value
d+d +d+ edge weight, keep smaller if exists
When destination vertex is circled
Find the actual route/path
Vertex value - edge weight = previous vertex value
GPS navigation, routing, scheduling, network optimization
Show more
Select your subjects, and get access to A+ resources today.