Spectral Graph Theory?
http://cs-www.cs.yale.edu/homes/spielman/TALKS/haifa1.pdf
On Thursday, 31 May 2012 14:37:21 UTC+1, Sean Devlin wrote:
>
> Hey folks,
> I'm looking for help demonstrating Clojure's superiority to Scala :)
>
> I have a contest going with a colleague, where we each have to rend
I did some network visualization a long time ago, and for big networks I
found it fast to call toxiclib from clojure for calculating the layout, and
use repulsive springs to generate my network, and once its relatively
stable, add additional repulsive springs between overlapping nodes, so that
This should work great. You guys rock :)
On Thursday, May 31, 2012 9:48:28 AM UTC-4, daveray wrote:
>
> Lacij (https://github.com/pallix/lacij) and Vijual
> (https://github.com/drcode/vijual) both implement graph layout
> algorithms in Clojure.
>
> Dave
>
> On Thu, May 31, 2012 at 6:42 AM, Ul
Lacij (https://github.com/pallix/lacij) and Vijual
(https://github.com/drcode/vijual) both implement graph layout
algorithms in Clojure.
Dave
On Thu, May 31, 2012 at 6:42 AM, Ulises wrote:
>> I have a contest going with a colleague, where we each have to render a
>> network layout in SVG. My gu
> I have a contest going with a colleague, where we each have to render a
> network layout in SVG. My gut says that Synthetic Annealing is the right
> tool for the job here.
I haven't heard of synthetic annealing (I have heard of simulated
annealing though) but if you're looking to draw a network
Hey folks,
I'm looking for help demonstrating Clojure's superiority to Scala :)
I have a contest going with a colleague, where we each have to render a
network layout in SVG. My gut says that Synthetic Annealing is the right
tool for the job here.
1. Does anyone have a better thought than s
