Question Completion Status:
Consider the graph below, and start node D: Applying Dijkstra's algorithm to find the shortest
path tree from node D, in what order do the nodes become permanent?
A
8
7
Other
D,C,E,B,F,A
D,C,B,E,F,A
D,B,E,C
4
B
5
6
E
C
3
2
D