emden

The algorithm is based on the work done with a summer intern long ago. The basic algorithm is fairly pretty but it was never published unfortunately. I believe I still...

Could you comment out all but the first 4 nodes in your graph. Then, lib/ortho/partition.c, uncomment the dumpTrap function, and put a call to it dumpTrap(trs, nt); right after the...

The code for loops is still fairly rudimentary and, as you've seen, has some problems. In particular, it doesn't automatically take into account extra space or trying to alternate loops...

I'm on the forum.

There is actually only one layout program. neato.exe, fdp.exe, etc. are just links to dot.exe. Alternatively, you can run dot.exe -K where can be neato, fdp, etc.

This is a duplicate of issue [1223](https://github.com/ellson/graphviz/issues/1223).

This bug exists in 2.38. It appears to be a really touchy corner case; If you modify any topological aspect, the bug goes away. It involves the temporary flipping of...

Here is a minimal example: ```C digraph { newrank=true subgraph { rank=same A B C } subgraph cluster1 { A -> C } subgraph cluster2 { B } C ->...

Definitely a bug. It is some strange interaction between the cluster being in a subgraph with rank=same set. (Go figure.) A simple workaround is to use newrank=true.

Technically, this isn't a bug, as dot can only promise to reduce crossings, not eliminate them. For directed acyclic graphs, minimizing crossings is NP-complete, so dot uses a heuristic. On...