Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsShortest path algorithms

Floyd–Warshall algorithm

Theory

Apply the algorithm

Report a typo

We have the adjacency matrix of a graph:

The adjacency matrix of a graph

Which of the options presented below is the shortest distance matrix. Of course, use the Floyd–Warshall algorithm.

a)

The shortest distance matrix, first option

b)

The shortest distance matrix, second option

c)

The shortest distance matrix, third option

d)

The shortest distance matrix, fourth option

Select one option from the list
___

Create a free account to access the full topic