Skip to content

Update BellmanFordAdjacencyList.java#317

Closed
choprasaurav7 wants to merge 1 commit intowilliamfiset:masterfrom
choprasaurav7:patch-1
Closed

Update BellmanFordAdjacencyList.java#317
choprasaurav7 wants to merge 1 commit intowilliamfiset:masterfrom
choprasaurav7:patch-1

Conversation

@choprasaurav7
Copy link
Copy Markdown

The relaxation should be running n-1 times.
We don't need to run the algo again n-1 times but only once on each edge to see if the value decreases and then we can confirm a negative cycle

The relaxation should be running n-1 times. 
We don't need to run the algo again n-1 times but only once on each edge to see if the value decreases and then we can confirm a negative cycle
@choprasaurav7
Copy link
Copy Markdown
Author

issue : #316

@williamfiset
Copy link
Copy Markdown
Owner

The current code is correct. Changing to <= would do V iterations, which is one extra - not harmful for correctness of shortest paths, but unnecessary.

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