Added Bellman-Ford Algorithm in Python#548
Merged
Pradeepsingh61 merged 1 commit intoPradeepsingh61:mainfrom Oct 8, 2025
Merged
Added Bellman-Ford Algorithm in Python#548Pradeepsingh61 merged 1 commit intoPradeepsingh61:mainfrom
Pradeepsingh61 merged 1 commit intoPradeepsingh61:mainfrom
Conversation
github-actions
Bot
added
first-time-contributor
good first issue
|
🎉 Welcome to Hacktoberfest 2025, @komalsrivastava282! 🎃 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. |
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
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.
This PR adds an original implementation of the Bellman-Ford algorithm in Python, designed to compute shortest paths from a single source in a weighted graph. It supports negative edge weights and includes robust detection for negative weight cycles.
The code is clean, well-documented, and includes multiple test cases covering standard, edge, and failure scenarios. It follows Python best practices and contribution guidelines.
✅ Features:
Input validation for source and edge vertices
Negative cycle detection with proper error handling
Time Complexity: O(V × E)
Space Complexity: O(V)
Five test cases including edge and failure scenarios
Inline comments and top-level docstring for clarity
Follows Python language conventions and formatting standards