Algorithm to construct a graph with minimal spanning trees

38 Views Asked by At

I need an algorithm that constructs an undirected graph given all of its minimal spanning trees (bases of a matroid) to find circles in the underlying graph. Has anyone an idea how I can do that? Thanks in advance!