| Menu × × Correct! Exercise:Using Dijkstra's algorithm to find the shortest paths from vertex C in this graph: What is the next vertex to be visited after C is visited? 
Using Dijkstra's algorithm,
the next vertex to be visited 
after vertex C is vertex @(1).
 
Using Dijkstra's algorithm,
the next vertex to be visited 
after vertex C is vertex B.
 
Using Dijkstra's algorithm,
the next vertex to be visited 
after vertex C is vertex b.
 Not CorrectClick here to try again. Correct!Next ❯ | 
This will reset the score of ALL 43 exercises.
Are you sure you want to continue?