Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsShortest path algorithms

Floyd–Warshall algorithm

A step of the algorithm

Report a typo

Select a step of the Floyd–Warshall algorithm.

Select one option from the list

Choosing any arbitrary node as a starting node.

Marking the distance of the starting node as permanent, all other distances as temporal.

Writing an initial distance matrix representing the distance between each pair of nodes.

Setting of a node with the minimal temporary distance as active.

___

Create a free account to access the full topic