SpanningTreesMatsui - manudubinsky/tinygarden GitHub Wiki

This class generates the set of spanning trees of a given graph. The set can be very large, so it is designed to process small instances, i.e.: graphs of at most 40 edges. Otherwise it will execute for a very long time.

It implements Matsui algorithm:

T. Matsui, Algorithms for finding all the spanning trees in undirected graphs, METR93-08, Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo (1993)

Every tree of the set is processed by a custom list of Collectors and Processors