3. Consider the following undirected, weighted graph: (12 points) 2 12 7 B D any А 2 F 3 3 E 10 Step through Dijkstra's

[answerhappygod]

1 (62.77 KiB) Viewed 52 times

3. Consider the following undirected, weighted graph: (12 points) 2 12 7 B D any А 2 F 3 3 E 10 Step through Dijkstra's algorithm to calculate the single-source shortest paths from A to every other vertex. Show your steps in the table below. Cross out old values and write in new ones, from left to right within each cell, as the algorithm proceeds. Also list the vertices in the order in which you marked them known. Known vertices (in order marked known): Vertex Distance Path