search

TYehan / Hello-World

⭐ You can contribute to this Repository by creating programs to print "hello world" in different programming languages. ⭐This repo is for practicing purposes so that beginners may know how to pull a request properly and get accepted.
4 stars 9 forks source link

Implement the Bellman-Ford Algorithm for Finding Shortest Paths #12

Closed Srishti2703 closed 1 year ago

Srishti2703 commented 1 year ago

This issue is dedicated to implementing the Bellman-Ford algorithm for finding the shortest paths in weighted graphs, including graphs that may contain negative-weight edges. The Bellman-Ford algorithm is a versatile graph algorithm that can be applied to various scenarios, such as network routing, financial modeling, and pathfinding.

Proposed Changes: The proposed changes for this issue include:

Implementing a Python function, say bellman_ford, that calculates the shortest paths from a specified source vertex to all other vertices in a weighted graph. Ensuring that the function can handle graphs with negative-weight edges and correctly computes shortest paths. Providing comprehensive documentation for the function, including examples and usage instructions. Benefits: The benefits of implementing this feature are as follows:

Enhanced graph analysis capabilities: Users can apply the Bellman-Ford algorithm to solve a wide range of problems, including those involving negative-weight edges. Improved codebase: The addition of this graph algorithm enhances the project's versatility for solving real-world problems.

TYehan commented 1 year ago

I appreciate your work but it is invalid regarding this.