Reproducing particular graph layouts usually can be achieved with: Invisible nodes and edges rank constraints Here’s how I reproduced your graph – or at least a part of it: digraph g { rankdir=”LR”; node[shape = circle, fontsize=14]; fontsize=18; labeljust=”l”; edge[style=invis, fontsize=12]; { rank=same; 0 [style = invis]; 01 [style = invis]; 02 [style=invis]; 0 -> … Read more
I think what you are looking for is generally called a Flood Fill. It is up to you whether you traverse the graph through a BFS or a DFS. Basically you take an unlabeled (AKA uncoloured) node and assign a new label to it. You assign the same label to all nodes adjacent to that … Read more
The DOT user manual gives the following example of a graph with clusters with edges between clusters: IMPORTANT: The initial compound=true statement is required. digraph G { compound=true; subgraph cluster0 { a -> b; a -> c; b -> d; c -> d; } subgraph cluster1 { e -> g; e -> f; } b … Read more