Home > Term: Floyd-Warshall algorithm
Floyd-Warshall algorithm
An algorithm to solve the all pairs shortest path problem in a weighted, directed graph by multiplying an adjacency-matrix representation of the graph multiple times. The edges may have negative weights, but no negative weight cycles. The time complexity is Θ (V³).
- Del af tale: noun
- Branche/domæne: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Ophavsmand
- GeorgeV
- 100% positive feedback