Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsShortest path algorithms

Floyd–Warshall algorithm

Theory

A matrix of the shortest distances

Report a typo

Given below in a directed graph:

Directed graph

Apply the Floyd-Warshall algorithm to find the shortest paths between all pairs of nodes in the graph. Which of the matrices below corresponds to the final matrix of the shortest distances?

Four variants of the final matrix of the shortest distances

Select one option from the list
___

Create a free account to access the full topic