[Lemon-user] Removing redundant paths in digraph?

[Tim Tautges]

Hi all,
   I have a ListDigraph that represents dependencies between nodes in the graph, for this example say 3 nodes, A, B, C, 
and 2 arcs, A-B and A-C.  Now I'd like to add a dependency B-C; after doing that, B will have ancestors A and C, and 
there will be two paths between A and B.  Since this is a dependency graph, there's no point in keeping the A-B arc, 
since B always has to wait for C anyway.  Is there an algorithm or combination of them in Lemon that would remove these 
sorts of things automatically?  I'm not formally trained in graph theory, but intuitively it seems like that could be 
phrased in terms of some of the path and flow algorithms.

BTW, great package, I've started using it in a mesh generation library I'm developing (will send a link when it's ready 
for release).

- tim

-- 
================================================================
"You will keep in perfect peace him whose mind is
   steadfast, because he trusts in you."               Isaiah 26:3

              Tim Tautges            Argonne National Laboratory
          (tautges at mcs.anl.gov)      (telecommuting from UW-Madison)
          phone: (608) 263-8485      1500 Engineering Dr.
            fax: (608) 263-4499      Madison, WI 53706