Add Floyd-Warshall algorithm in Java with example usage #6795
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
a) What it does:
Implements Floyd-Warshall algorithm in Java
Includes an example usage with a sample graph
b) Why it’s useful / reason for the PR:
Adds a common shortest-path algorithm to the algorithms repository
Useful for beginners and competitive programmers
c) Any notes / instructions:
File added: FloydWarshall.java
Tested locally on sample graphs
Issue closed #6795