My mincut supertree implementationdarwin.zoology.gla.ac.uk/~rpage/supertree

• Written in C++

• Uses GTL (Graph Template Library) to handle graphs (formerly a free alternative to LEDA)

• Finds all mincuts of a graph faster than Semple and Steelís algorithm

Previous slide

Next slide

Back to first slide

View graphic version