algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2026-02-04 12:50:12 +08:00
Code Issues Packages Projects Releases Wiki Activity
579 Commits 2 Branches 0 Tags
2cbaa808af5bbc0a95def29f8aa817545dd17326
Commit Graph

2 Commits

Author SHA1 Message Date
Ayush Nagar
ba22b1c6b8 Update FloydWarshall.java 2018-05-06 17:16:19 +05:30
Ayush Nagar
35a4bd314d used to find the shorthest paths among all pairs of nodes in a graph, 
Floyd-Warshall algorithm is a procedure, which is used to find the shorthest (longest) paths among all pairs of nodes in a graph, which does not contain any cycles of negative lenght. The main advantage of Floyd-Warshall algorithm is its simplicity.
 2018-03-18 20:52:50 +05:30