[[Graph and Networking Algoriithms]]
Dijkstra's shortest path algorithm. Finds the shortest path between two nodes after trying all the possible combinations. Works for positive lengthed edged graphs.
![[Image for Dijkstra's algorithm.png]]
| A | 0 | A |
|---|---|---|
| B | 7 | A |
| C | 12 | A |
| D | 16 | B |
| E | 20 | D |
| F | 17 | D |
#algorithms #networking