CS 3.6. (ALEVEL) - Optimisation Algorithm Flashcards

(2 cards)

1
Q

Dijkstra’s Algorithm

A
  • 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
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Application of Dijkstra’s Algorithm

A
  • satellite navigation systems
  • routers (shortest path when routing packets within network)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly