Open
Conversation
* add data structures * init data structures * add path augmentign method * add labling method * implement the algorithm * remove warnings * fix queue pop/push calls * fix retrieval of v and w in augment method * fix last part of label method * fix Matching.isValid() from what I tested, if the given graph has the vertices starting from anything other than 0, this method will throw an `IndexOutOfBounds` exception, as such `graph.indexOf()` must be used to bypass that * implement queue using int[] * refactor edge array * optimize search * fix comments * optimize labeling using bit operations * remove comments * implement union find data structure * add better documentation * give up on old normalization method * fix small things * remove comment * add to the matching only matched edges
This file contains hidden or 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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
A short description of the implementation details and the results can be found here, along with some very basic test cases.