-
Notifications
You must be signed in to change notification settings - Fork 4.3k
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
Relaxation in Bellman Ford #316
Comments
|
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
If I understand the algorithm correctly, since we need to do relaxation n-1 times shouldn't the loop run from i=0; i<=V-1 ?
Algorithms/src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordAdjacencyList.java
Line 57 in 65dcc1b
why do we need to check for negative cycle n-1 times again? Can we just loop over the edges to see if distance is decreasing and detect negative cycle?
Algorithms/src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordAdjacencyList.java
Line 66 in 65dcc1b
The text was updated successfully, but these errors were encountered: