|
|
|
| Trace
– Dijkstra’s algorithm gradually expands set of |
||
| ‘Certain’
vertices |
||
| Graph: |
| 7 |
| 3 |
| 4 |
| C |
| 6 |
| S |
| 4 |
| 8 |
| 3 |
| 1 |
| 2 |
| T |
| 5 |
| 7 |
| B |
| E |
| nextToDo Certain pathLength pathPred |
| Of: Is: |
| Of: Is: |