[efh] Graph placement by simulated annealing using forces

[Drake Wilson]

After about a quarter of a megasecond of task latency (shame on
me?)...

The original paper, on Google Scholar:
  http://scholar.google.com/scholar?hl=en&lr=&cluster=4616970964563581515

My C source (requires GNU C unless you lambda-lift the nested function):
  http://begriffli.ch/files/marginal-hacks/graph-annealing.c

Yes, there's a bunch of tweaking-values put in as #defines, but I
gather that's semi-SOP for quick C programs of this sort.  :-P  The
code is public domain, so feel free to experiment with the algorithm,
or turn it into something else, or do whatever you want.  No warranty.

   ---> Drake Wilson
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: Digital signature
Url : http://home.actlab.utexas.edu/pipermail/efh/attachments/20070330/98454208/attachment.pgp