Skip to content
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.

Sign up for GitHub

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

Jump to bottom

Disjoint Set Ouput #3

Open
zakird opened this issue Nov 14, 2015 · 0 comments
Open

Disjoint Set Ouput #3

zakird opened this issue Nov 14, 2015 · 0 comments
Assignees
@alichator
Labels
enhancement

Comments

@zakird
Copy link
Member

zakird commented Nov 14, 2015

We need to implement an iterator over the tree that returns disjoint sets that cover the entire data structure. Essentially we need to be able to convert a routing table to a flat dataset that could be imported into a database with a start and end IP for each entry.
@zakird zakird assigned zakird and alichator and unassigned zakird Nov 14, 2015
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@alichator alichator

Labels
enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@zakird @alichator