Hi All,

Thanks to some ftp space from Ned, I've posted some updates to the Aglo Graphing 
Package on SqueakMap.

Here's the scoop:

This is some experimental graph layout code for Connectors that Ned started 
playing with at one point. It is based on the Aglo layout algorithm.

See http://www.cs.ucla.edu/%7Estott/aglo/ for more on Aglo.

This algorythm lays out connectors nodes and edges in a pleasing graph, 
according to the following aesthetics:  
EdgeFlowHang, Centripidal, EdgeRepulsion, NodeRepulsion, MinimumEdgeLength, and 
SpringEdgeLength.

Run the class NCGraphLayoutAlgorithmTest in the SUnit TestRunner to see a demo.  

Then, it's easy to follow the code.


Enjoy!
Delbert