Graphviz 如何在不改变安排的情况下将交易对手B连接到C,反之亦然
如何在不更改安排设置的情况下将交易对手B连接到D,反之亦然 这是密码Graphviz 如何在不改变安排的情况下将交易对手B连接到C,反之亦然,graphviz,dot,edges,Graphviz,Dot,Edges,如何在不更改安排设置的情况下将交易对手B连接到D,反之亦然 这是密码 digraph graphname { A [label="Counterparty A" color=Blue, fontcolor=Red, fontsize=24, shape=box] // node T B [label="Counterparty B" color=Blue, fontcolor=Red, fontsize=24, shape=box] // node P
digraph graphname {
A [label="Counterparty A" color=Blue, fontcolor=Red, fontsize=24, shape=box] // node T
B [label="Counterparty B" color=Blue, fontcolor=Red, fontsize=24, shape=box] // node P
C [label="Counterparty C" color=Blue,fontcolor=Red,fontsize=24,shape=box]
D [label="Counterparty D" color=Blue, fontcolor=Red, fontsize=24, shape=box]
A->{B,C}->{D}[fontcolor =darkgreen,dir="both"]
你的主题行是B到C,但在课文中你说B到D,因此混淆
graphviz
需要另一条指令,告诉它将B
和C
保持在同一等级,请参见下面的注释代码
digraph graphname
{
// introduced to increase the distance between B and C:
nodesep = .5;
A [label="Counterparty A" color=Blue, fontcolor=Red, fontsize=24, shape=box] // node T
B [label="Counterparty B" color=Blue, fontcolor=Red, fontsize=24, shape=box] // node P
C [label="Counterparty C" color=Blue,fontcolor=Red,fontsize=24,shape=box]
D [label="Counterparty D" color=Blue, fontcolor=Red, fontsize=24, shape=box]
A->{B,C}->{D}[fontcolor =darkgreen,dir="both"]
// we make sure that the two nodes B and C stay side by side,
// and connect them:
{ rank = same; B -> C[ dir = both ] }
}
屈服
你的问题不够清楚。你是说从B到C?B和D已连接。