Is there any existing code in the src of ghc (0.29) to enumerate the cycles of a strongly connected component? It doesn't seem to be in utils/Digraph.lhs. If such code doesn't exist, has anyone out there coded it before, so that I can reuse? Thanks, Aik hui
