forked from rcpoison/jgrapht
-
Notifications
You must be signed in to change notification settings - Fork 6
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
Revert km #3
Closed
Closed
Revert km #3
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
Fix for bug in Floyd Warshall Implementation (#5)
Support hashCode() and equals() methods for graphs
… a Maximum Matching in a bipartite graph. Included unit tests as well.
Min source-sink cut alg and Hopcroft-Karp max bipartite matching alg.
…pensive HopcroftKarpBipartiteMatching input validation only run when assertions are enabled.
- Negative edge weights cause an exception in the constructor - Zero edge weights work - 0 < Weights < 1.0 work - Multigraphs work - Graphs with less than 2 vertices cause an exception in the constructor - Graphs with 2 vertices work - Removed unneeded List to conserve memory - Constructor takes UndirectedGraph instead of WeightedGraph as weights are optional but directed edges are forbidden. This is an incompatible interface change!
Fix multiple bugs in StoerWagnerMinimumCut
…m for edges having weight != 1.0
update SCM section of maven's pom.xml to reflect github infrastructure
Slightly refurbished MST tests; added backward-compatibility testing facility; Other minor updates;
Prim's algorithm for finding MST added
To compare floating-point numbers, we need to provide a delta. This fixes a failing build using Java 7.
Add DirectedWeightedPseudograph
Quick Fix (one line)
Fix DirectedMultigraph
Embed manifest in jar Junit dependency is only is test scope
Fix jgrapht-core pom
… having minimal weight in bipartite graphs; Abstracted Matching/WeightedMatching interfaces; Adapted Edmond's 'Blossom Shrinking' and Hopcroft-Karp algorithm to accommodate interfaces derived;
Added graph-builder interface to accommodate facilities for building graphs upon matrix representation; Added matrix-graph-builders for simple-weighted graphs instances;
…aphBuilder` interface with `GraphGenerator` one
Kuhn-Munkres (Hungarian) algorithm added
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.
No description provided.