CS 3.6. (ALEVEL) - Optimisation Algorithm

Question 1

Dijkstra’s Algorithm

Answer 1

• used to find shortest path between two nodes in a graph
• similar to breadth-first search but keeps track of visited nodes with priority queue

Question 2

Application of Dijkstra’s Algorithm

Answer 2

• satellite navigation systems
• routers (shortest path when routing packets within network)