Floyd–Warshall algorithm (Q1047576)

From Wikidata
Jump to: navigation, search
algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative
  • Warshall–Floyd Algorithm
edit
Language Label Description Also known as
English
Floyd–Warshall algorithm
algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative
  • Warshall–Floyd Algorithm

Statements

0 references
0 references
0 references
Floyd-Warshall algorithm

Identifiers