【发布时间】:2013-05-13 18:31:25
【问题描述】:
我向 Dot 提供以下输入:
digraph G {
subgraph cluster1 {
fontsize = 20;
label = "Group 1";
A -> B -> C -> D;
style = "dashed";
}
subgraph {
O [shape=box];
}
subgraph cluster2 {
fontsize = 20;
label = "Group 2";
Z -> Y -> X -> W [dir=back];
style = "dashed";
}
D -> O [constraint=false];
W -> O [constraint=false, dir=back];
}
它会产生:
如何对齐节点O 使其与D 和W 具有相同的等级?也就是说,如下图:
A Z
| |
B Y
| |
C X
| |
D-O-W
添加
{ rank=same; D; O; W; }
产生错误
Warning: D was already in a rankset, ignored in cluster G
Warning: W was already in a rankset, ignored in cluster G
我想我可以通过在O 的子图中添加不可见的节点和边来破解它,但我想知道我是否遗漏了一些点魔法。
【问题讨论】: