Fix Moore-Bellman-Ford for unweighted edges #81
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
Finally resolved: This was actually an issue with undirected edges. PR updated accordingly and WIP marker removed. This is now ready for review / merge. Given how trivial this fix is, I'm looking forward to merge this soon. |
clue
added a commit
that referenced
this pull request
Dec 29, 2013
Fix Moore-Bellman-Ford for unweighted edges
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Spotted an issue while adding unit tests for Algorithm\DetectNegativeCycle (#88):
Detecting negative cycles fails for graphs with multiple components.Turns out this was actually an issue with unweighted edges, which caused their weights to be re-calculated on each iteration which was then interpreted as a negative cycle. This PR fixes this by explicitly considering a
nullweight as(int)0weight.