Lecture 2 - Dijkstra's Flashcards
1
Q
What does Dijkstra’s algorithm do ?
A
Finds the shortest path between 2 nodes in a graph.
2
Q
Applications of Dijkstra’s?
A
- flight reservations
- internet packet routing
- driving directions
UOFG_Algorithmics_1 > Lecture 2 - Dijkstra's > Flashcards
What does Dijkstra’s algorithm do ?
Finds the shortest path between 2 nodes in a graph.
Applications of Dijkstra’s?
UOFG_Algorithmics_1 (43 decks)