Extracting display trees from networks

Extracting display trees from a network can lead to really large lists of trees, we need to support iterator/streaming extraction in order to keep the footprint low. It also might be best to have the ability to iterate in the order sorted by the probability of the display tree (defined based on the inheritance probabilities at the reticulate node resolutions).