Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsShortest path algorithms

Dijkstra's algorithm

Theory

The shortest path tree

Report a typo

Given below is a directed weighted graph:

Directed weighted graph

Using Dijkstra's algorithm, build the shortest path tree with a root in the node a. Which of the graphs below corresponds to this tree?

a:

The shortest path tree (option a)

b:

The shortest path tree (option b)

c:

The shortest path tree (option c)

d:

The shortest path tree (option d)

Select one option from the list
___

Create a free account to access the full topic