How to prevent edges in graphviz to overlap each other

Graph TheoryGraphvizOverlap

Graph Theory Problem Overview


I have a graph I've created in graphviz, but the problem is that edges overlap each other (I have 5-7 nodes in each row), so it is hard to tell for each node which are the nodes it connects.

How can I make the edges not to overlap each other? Have them cross each other is OK.

Graph Theory Solutions


Solution 1 - Graph Theory

I'm assuming you have a directed graph which you layout with dot.

I don't think there's a magic switch to prevent overlapping edges. Graphviz tries to do that out of the box.

Some suggestions that may help, depending on the graph:

  • edge concentrators (concentrate=true): Merge multiple edges with a common endpoint into single edges, and have partially parallel edges share parts of their path.
  • ports : Edges can have their origin and endpoint on a specific port (n, ne, e, se, s, sw, w, nw, w, c, _). Depending on the edge ports, the edge changes its form (spline).
  • invisible nodes : There may be cases where introducing invisible nodes to route edges can have the desired effect.

Solution 2 - Graph Theory

Another approach is to add an overlap property to the graph. Allowable properties are scale (which will vastly increase the size of the output) or false (which will not increase the size as much, but will probably cause edges to overlap nodes).

overlap = scale;

If you're using overlap=false, you can get rid of edge overlaps with nodes by adding the attribute splines=true:

overlap = false;
splines = true;

This will slow down generation time noticeably for large graphs.

Solution 3 - Graph Theory

Even for quite trivial graph I see graphviz (neato, fdp) to generate overlaps. For example:

graph G {
0;
1;
2;
3;
0--1 ;
1--2 ;
2--3 ;
3--0 ;
}

Produces a cross in my version of the code 2.38.0.

From the documentation they recommend trying with different random seeds in these cases. Eventually for more complex diagrams crossings will be unavoidable, I am not sure how much effort the engine puts in avoiding crossing.

For example, this worked for me:

neato -Gstart=5 file.dot -Tps -o file.ps

Attributions

All content for this solution is sourced from the original question on Stackoverflow.

The content on this page is licensed under the Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) license.

Content TypeOriginal AuthorOriginal Content on Stackoverflow
QuestionDavid RabinowitzView Question on Stackoverflow
Solution 1 - Graph TheorymarapetView Answer on Stackoverflow
Solution 2 - Graph TheoryJoel ReinView Answer on Stackoverflow
Solution 3 - Graph TheoryalfCView Answer on Stackoverflow