Facts
Urlhttps://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm
Sources
Wikipedia, Floyd-Warshall algorithm
Lead sectionQuote, Lead section
In computer science, the Floyd-Warshall algorithm (also known as Floyd's algorithm, the Roy-Warshall algorithm, the Roy-Floyd algorithm, or the WFI algorithm) is an algorithm for finding shortest paths in a directed weighted graph with positive or negative edge weights (but with no negative cycles).
View the Source Claims Backed By This Source (8 claims)
This source backs 8 claims across the atlas. As facts: 2 well-attested. As cited relationships: 4 holds. Plus 2 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Algorithms, 7 claims: 1 well-attested, 4 holds, 2 general references.
- Sources, 1 claims: 1 well-attested.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.