Adds a faster way of counting topologies in the DAG, by setting all internal labels to be the same, and combining nodes according to their child clade sets
Provides new methods to compute path DAGs (in label space) for a given leaf node label like the one attached (although maybe without the self loops)
outdag.pdf
Tests related to topology counting and newick string generation are modified to remain meaningful.
Tests related to topology counting and newick string generation are modified to remain meaningful.