Hi, Am Montag, den 14.05.2012, 07:21 -0700 schrieb Simon Michael: > I wonder how to simplify the graph further. Perhaps just the dependencies of > tags would be interesting in some repos ?
I think you’d want to collapse [a]→[b] to [a,b], if no other edges leave a or reach b. This way you only get arrows at branching and merging points. Greetings, Joachim -- Joachim "nomeata" Breitner m...@joachim-breitner.de | nome...@debian.org | GPG: 0x4743206C xmpp: nome...@joachim-breitner.de | http://www.joachim-breitner.de/
signature.asc
Description: This is a digitally signed message part
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
