Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Using Bellman Ford Algorithm #5

Open
shreya1010svg opened this issue Oct 21, 2020 · 1 comment
Open

Using Bellman Ford Algorithm #5

shreya1010svg opened this issue Oct 21, 2020 · 1 comment
Labels
bounty~100 Worth atleast 100 points documentation Improvements or additions to documentation

Comments

@shreya1010svg
Copy link
Contributor

Is your feature request related to a problem? Please describe.
In a realistic scenario it is seen that there can be delay in traffic or a sudden emptiness of roads(smaller lanes to the main road) which can make the speed of the car vary greatly. Hence it is necessary to be able to deal with negative weights and the detection of negative cycles.

Describe the solution you'd like
Instead of Dijkstra's algorithm can Bellman Ford algorithm be applied.

Additional changes
Make necessary changes in the Propogation of Updates also and comment on the efficiency by adding to the documentation.

@shreya1010svg shreya1010svg added documentation Improvements or additions to documentation bounty~100 Worth atleast 100 points labels Oct 21, 2020
@bvgaurav4
Copy link

can i do this?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
bounty~100 Worth atleast 100 points documentation Improvements or additions to documentation
Projects
None yet
Development

No branches or pull requests

2 participants