Floyd warshal in Go #585
Merged
Floyd warshal in Go #585
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
github-actions
bot
added
first-time-contributor
go
good first issue
|
🎉 Welcome to Hacktoberfest 2025, @Shubham-Khetan-2005! 🎃 Thank you for your first contribution to our DSA repository! Here's what happens next: 🔍 Automatic Checks
📋 Next Steps🎯 Great job! Your code compiled successfully. Maintainers @Karanjot786 and @Pradeepsingh61 will review your PR soon. 🎁 What You Get
💡 Tips for Success
Welcome to the community! 🚀 |
🤖 Automated PR Status🔍 Code Validation✅ Passed - File naming and structure look good! 🧪 Compilation Tests✅ Passed - All code compiles successfully! 📋 Overall Status🎉 Ready for Review - Your PR has passed all automated checks! This comment was generated automatically. Checks will re-run when you push new commits. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
Add Floyd-Warshall All-Pairs Shortest Path Algorithm in Go
Added an implementation of the Floyd-Warshall algorithm, a dynamic programming approach to find the shortest paths between all pairs of vertices in a weighted, directed graph. This algorithm is notable for its ability to handle negative edge weights and detect the presence of negative-weight cycles.
Features 🚀
Computes the shortest path distances for every pair of vertices in the graph.
Returns two matrices: a distance matrix and a next matrix, which facilitates easy reconstruction of the shortest path.
Correctly processes graphs with negative edge weights.
Provides robust negative-weight cycle detection. If a cycle is found, the algorithm indicates that the shortest paths are indeterminate.
Includes a thorough test suite that verifies correctness on graphs with positive weights, negative weights, negative cycles, and disconnected components.
Complexity Analysis 📊
Time Complexity
O(V
3
), due to its three nested loops over the set of vertices, making it suitable for dense graphs.
Space Complexity
O(V
2
) to store the distance and next matrices for all pairs of vertices.