ordering edges

digraph G {
rankdir=TD;
{
rank=same;A;B;
}
C;D;
a1; a2; b1; b2;c1;c2;d1;d2;
A -> {a1;a2;}
B -> {b1;b2;}
C -> {c1;c2;}
D -> {d1;d2;}
A -> B ;
C -> D [minlen=2];
A -> C [minlen=2];
B -> D [minlen=2];
}

The goal is to have 'straighter' paths from A->C, C->D and B->D.

The desired behavior that would accomplish the goal is to have edges:
A->{a1;a2;} render before A->C (from left to right)
C->{C1;C2;} render before C->D (from left to right)

I have tried ordering, outputorder, order in which nodes and edges are added to no avail. Thanks.

why minlen=2 ?

It seems better to try e.g.   A -> C [weight=1000]

 

Works for me: digraph G

Works for me:

digraph G {
{
rank=same;A;B;
}
C [ordering=out]
D;
a1; a2; b1; b2;c1;c2;d1;d2;
A [ordering=out]
A -> {a1;a2;}
B -> {b1;b2;}
C -> {c1;c2;}
D -> {d1;d2;}
A -> B ;
C -> D [minlen=2];
A -> C [minlen=2];
B -> D [minlen=2];
}

If this doesn't give you what you want, please file a bug report so that we can have more information. Thanks.

Recent comments