[plt-dev] PLT Dependency Graph

From: Noel Welsh (noelwelsh at gmail.com)
Date: Sat Jan 23 03:44:56 EST 2010

Maybe everyone else has 30" monitors, but at least on my monitor I
can't see any particular structure in this graph. It would be
interesting and perhaps more enlightening to run some simple graph
analysis algorithms on this data. E.g. pagerank or some spectral
clustering algorithm. (Most of these algorithms rely on finding the
eigenvectors of some similarity matrix, which you can compute in
Scheme using the SVD implementation in my GSL bindings)


On Sat, Jan 23, 2010 at 2:01 AM, Jay McCarthy <jay.mccarthy at gmail.com> wrote:
> In case you've ever wondered what the collects dependency graph looks
> like for PLT. Petey Aldous prepared this:
> http://faculty.cs.byu.edu/~jay/tmp/201001221858-plt-dep/dep.png
> The corresponding DOT file is:
> http://faculty.cs.byu.edu/~jay/tmp/201001221858-plt-dep/dep.dot
> (In case you have a better layout algorithm.)
> We have a DOT file on a file basis too, but DOT can't handle its size.
> Jay

Posted on the dev mailing list.