Disjoint Set Ouput #3
Description
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.