Add union operation on k2 tree #425
Open
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
Add swap function to node iterator simongog#1
(get neighbour lazy)
|
Right now the current fork has added the union operation for k2trees and also added the edge iterator, neighbor iterator and node iterator for the k2tree. This was used in another project in order to implement a dynamic k2tree based on static bit vectors from Coimbra, Miguel E., et al. "On dynamic succinct graph representations." 2020 Data Compression Conference (DCC). IEEE, 2020. |
Remove rebuild in the end of union operation
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.
Created the union operation for k2 tree based on Brisaboa, Nieves R., et al. "Efficient Set Operations over k2-Trees." 2015 Data Compression Conference. IEEE, 2015.