Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsShortest path algorithms

Dijkstra's algorithm

The shortest route between two cities

Report a typo

Given below is an undirected weighted graph:

Find the shortest path in an undirected weighted graph

Using Dijkstra's algorithm, find the shortest path from the city A to the city F. Choose one of the options below that corresponds to this path.

Select one option from the list

A -> B -> D -> F

A -> C -> E -> F

A -> C -> D -> F

A -> B -> C -> E -> F

___

Create a free account to access the full topic