Question: If we run Dijsktra's algorithm on a graph with 7 vertices and obtain the following matrix Vertic Visited Distro Edge To 0 0 -1 1

If we run Dijsktra's algorithm on a graph with 7 vertices and obtain the following matrix Vertic Visited Distro Edge To 0 0 -1 1 5 0 o 2 14 6 3 5 5 0 6 0 4 5 om 6 3 6 13 1 8 5 7 WHAT IS THE CALCULATED SHORTEST PATH FROM VERTEX O to 7. A. 0157 B. 0357 C. 0127 D. 0 1 3 7
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
