Q1047576

From Wikidata
Jump to: navigation, search

Floyd–Warshall algorithm (Q1047576)[edit]

an algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative [edit]

No aliases defined. [add]

Statements