Feature/bipartit #1130
Open
Feature/bipartit #1130
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
…t_graph gtests: increase graph related function coverage
…ts_components gtests: adds randomSpanningForest test
…t_algebraic gtests: adds algebraic tests
…t_community gtests: adds community tests
…ts_sparsification gtests: adds sparsification tests
…ts_coarsening gtests: adds coarsening test
…nimum_ spanning forest
…ations Remove previous deprecations for release 11.0.
…veEdges_restoreApi restore_removeEdge_api
Complex paths
Update README.md / GHA concerning min/max versions
…rmat-explanation-and-guess-format Fix: networkit binary format explanation and update guess format
…luby cpp: make lubys algorithm deterministic
…ersion Set version to 11.0.
…ssifier Fix typos in Python package classifier
…pliant with style guidelines
…ipartit # Conflicts: # CMakeLists.txt # networkit/cpp/CMakeLists.txt
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.
This algorithm is an implementation of the standard BFS-search algorithm to check if a graph is bipartit, running in O(n + m).
If the graph is bipartit a partition is provided, otherwise the first odd cycle found by the algorithm is provided.
The algorithm could be sped up even more if the odd cycle didn't matter, however as it likely won't be the bottleneck for most applications I favoured utility over a slight increace in speed. If necessary the code is easy to adapt.