Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsShortest path algorithms

Floyd–Warshall algorithm

Theory

Apply the algorithm – 2

Report a typo

Below is the adjacency matrix of a graph:

The adjacency matrix of a graph

Using the Floyd–Warshall algorithm, find the shortest distance matrix.

a)

The shortest distance matrix (a)

b)

The shortest distance matrix (b)

c)

The shortest distance matrix (c)

d)

The shortest distance matrix (d)

Select one option from the list
___

Create a free account to access the full topic