Counting spanning trees and flacets of a graph

The code counts the facets and the vertices of the spanning tree polytope of a graph.

The spanning tree polytope of a graph G is a particular case of matroid base polytopes. Its vertices correspond to the spanning trees of G, and its facets to some subgraphs G called flacets (from matroid terminology). The code simply counts the number of spanning trees and flacets of a graph, given its adjacency matrix.