Floyd–Warshall algorithm
id:
floyd-warshall-algorithm-168-9588743
title:
Floyd–Warshall algorithm
text:
In computer science, the Floyd–Warshall algorithm is an algorithm for finding shortest paths in a directed weighted graph with positive or negative edge weights. A single execution of the algorithm will find the lengths of shortest paths between all pairs of vertices. Although it does not return details of the paths themselves, it is possible to reconstruct the paths with simple modifications to the algorithm. Versions of the algorithm can also be used for finding the transitive closure of a rel
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm in graph theory
original url:
https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm
date created:
2003-05-20T08:52:59Z
date modified:
2024-08-30T22:40:26Z
main entity:
{"identifier":"Q1047576","url":"https://www.wikidata.org/entity/Q1047576"}
image:
fields total:
13
integrity:
15