lws@comm.wang.com (Lyle Seaman) (05/07/91)
I'm putting together a little one-off, and I need an algorithm (source would be especially nice) that, given a DAG, chooses chooses a placement of nodes on a plane, such that there is a minimal number of edge crossings. Optimal is NOT necessary, nor is speed. This is basically the same problem that circuit layout programs face, only I don't need as high-quality a solution. -- Lyle 508 967 2322 lws@wang.com Wang Labs, Lowell, MA, USA