Re:Links between Paul Graham's essays - revisited
by jjs on Monday December 15, 2008 @01:09AM
(#398100)
Not sure if it will work, but try:
1) Rendering an undirected graph via graphviz's neato tool.
2) Rendering to svg, which might let graphviz not have to keep as much rendering information in memory at any one time.
3) Asking about it on the grapviz-interest mailing list. https://mailman.research.att.com/mailman/listinfo/graphviz-i...
Re:Links between Paul Graham's essays - revisited
by Eliezer on Monday December 15, 2008 @05:53AM
(#398229)
Yeah, it's that thing with the segfault that I worried about. "Highly interconnected." Thanks for the graph, which I may be able to use for my own purposes even if I can't show it.
There's got to be standard graphing tools for things that are highly connected...
Re:Links between Paul Graham's essays - revisited
by khafra on Monday December 15, 2008 @08:20AM
(#398295)
When Daniel J. Bernstein made his DAGs of standard crypto algorithms (http://cr.yp.to/cipherdag/cipherdag-20070630.pdf) he mentioned that they'd crashed every standard drawing tool he tried. He makes a reference to "...my own drawing tools, which are much more careful in their use of memory." Unfortunately, I'm not sure where to obtain DJB's drawing tools.
Output from the above is at: http://jey.kottalam.net/tmp/obgraph.out
I tried rendering this with "dot -Tcmapx -oob.map -Tgif -oob.gif" but dot segfaulted after 70 minutes. The code as posted at gist only outputs nodes for articles written by Eliezer in an attempt to make the dot file a manageable size. Tips/fixes appreciated.