Hi,

I have this graph

```
digraph {
layout=dot ranksep=1 nodesep=1
c_1 -> c_2 -> c_3
v_1 -> v_2 -> v_3
p_1 -> p_2 -> p_3
edge[constraint=false]
c_1 -> v_1 -> p_1
c_2 -> v_2 -> p_2
c_3 -> v_3 -> p_3
#subgraph cluster_root {
subgraph cluster_c { label="c" c_1 c_2 c_3 }
subgraph cluster_v { label="v" v_1 v_2 v_3 }
subgraph cluster_p { label="p" p_1 p_2 p_3 }
#}
edge[constraint=true]
v_3 -> m_1
}
```

the second graph is the same and I just uncommented cluster_root

Then

dot.exe -Tsvg ./output/last/demo2.dot > ./dist/svg/demo2.svg

dot.exe -Tsvg ./output/last/demo1.dot > ./dist/svg/demo1.svg

And I did that multiple times… few screenshots demonstrate the different results.

Sometimes I have the right order, sometimes not.

Is there a way of writing a deterministic graph?

os : windows 10

graphviz : dot - graphviz version 2.49.3

Thanks