🚀 go-pugleaf

Hello,

I'writing a program for my thesis and ran into a graph-problem.

Given a directed graph that may contain arbitrary cycles, represented
as a list of From-To node tuples, I need to perform two tasks:

- remove all redundant links from the graph

- detect all cycles and 'shrink' them into a single node

Shrinking means that all the nodes in the cycle will be removed
and a shrinknode will be inserted into the graph, which will be
connected to all nodes that had a link to any of the cycle's nodes
before (Was that precise enough?).

I'm using quintus prolog (the predicates I need are not in the
library), but solutions in any other dialect will do.

I'd greatly appreciate any hints, implementations, pointers to
literature, newsgroups, ftp-sites or whatsoever you think I could use.


Thanks for helping,  OliKai