Skip to content

Added more information in finding negative cycle using Bellman-Ford #1299

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

Merged
merged 2 commits into from
Jul 11, 2024

Conversation

svaderia
Copy link
Contributor

The information is taken from the Bellman-Ford page. I felt it should be present here as well to make this article self-sufficient.

Also modified the code to remove the redundant check since d is initialised to 0 instead of INF so the check is not required.

The information is taken from the [Bellman-Ford](https://cp-algorithms.com/graph/bellman_ford.html) page. I felt it should be present here as well to make this article self-sufficient.

Also modified the code to remove the redundant check since `d` is initialised to `0` instead of `INF` so the check is not required.
Copy link
Contributor

Visit the preview URL for this PR (for commit 3b43753):

https://cp-algorithms--preview-1299-jc1x7anb.web.app

(expires 2024-07-04T15:26:17.409422771Z)

@adamant-pwn
Copy link
Member

Thanks!

@adamant-pwn adamant-pwn merged commit 8d9bddc into cp-algorithms:master Jul 11, 2024
2 checks passed
@svaderia svaderia deleted the patch-2 branch July 11, 2024 14:51
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants