Ignore this box please.
More
Settings
Goodies
About
Help
Feedback
PRIVACY
DontTrack
DontBubble
Policy
COMMUNITY
Platform
Forum
Chat
Spread
Search syntax
s:d sort by date
r:uk uk region
site: domain search
\ search first result
More...
r:n turn off region
!a search search amazon
site:uk uk pages
f: find files
t: within title
b: within body
More explanation...
Floyd-Warshall algorithm
In computer science, the Floyd–Warshall algorithm is a graph analysis algorithm for finding shortest paths in a weighted graph and also for finding transitive closure of a relation R. A single execution of the algorithm will find the lengths of the shortest paths between all pairs of vertices, though it does not return details of the paths themselves.
More at Wikipedia
Dijkstra's algorithm
Johnson's algorithm
More related topics
Polynomial-time problems
Routing algorithms
Dynamic programming
Graph algorithms
This page requires Javascript.Get the non-JS version
here
.