January 15, 2011 7:36 PM Subscribe
Newbie Graph Theory: How can I find all the faces of a planar undirected graph? Or, what I think is equivalent, all of the chordless cycles (cycles in which no two nodes are connected by any path other than a subset of the cycle) .
I'm fairly sure this is wrong
, as it will find cycles whose elements are connected by non-cycle paths if those connections aren't direct.
I have a feeling spanning trees are involved...