>> I wonder how big the graphs they use it for are? I mean, you can only 
>> fit a small number of nodes in a single drawing anyway...
> 
> I'd guess that a few tens to a few hundred nodes is not too uncommon.

...Jesus Christ! o_O

OK, sure, you definitely don't want to use an NP-complete algorithm. :-}

>> I think I'm going to reimplement it in light of what I've learned from 
>> GraphViz. (E.g., it uses invisible nodes that don't show up on the 
>> drawing, but *do* help it to route edges so they don't collide. I can 
>> copy that easily enough.)
> 
> I'll be interested to see how it looks.  I assume you'll also be 
> dropping the bounding box for collision avoidance? :)

Yeah, I'm not overly worried about a few lines crossing. I may or may 
not need to do something about avoiding one path being partially on top 
of another for any great length though...

-- 
http://blog.orphi.me.uk/
http://www.zazzle.com/MathematicalOrchid*

Post a reply to this message