allSpanningTrees Q
This method returns all of the spanning trees of the underlying graph of the quiver Q. Trees are represented as lists of arrow indices.
The algorithm is a brute force one, which takes all size N - 1 subsets of the quiver arrows, where N is the number of vertices in the quiver, and checks if the result is a connected graph.
|
|
The object allSpanningTrees is a function closure.