Generate a dependency graph, and display it if optional do_display is True.
>>> go(do_display=False)
digraph {
node [shape=box];
ranksep=0.4;
{rank=same; "n05";}
{rank=same; "n01"; "n02";}
{rank=same; "n04"; "n06";}
{rank=same; "n00"; "n03"; "n08"; "n10";}
{rank=same; "n07"; "n09";}
n00 [label="Acoustic Models", style=bold, shape=box];
n01 [label="Graph / Lattice", style=bold, shape=octagon];
n02 [label="Serialization", style=bold, shape=octagon];
n03 [label="Audio", style=bold, shape=box];
n04 [label="Dataflow", style=bold, shape=octagon];
n05 [label=" Utilities / Containers ", style=bold, shape=octagon];
n06 [label="CFG", style=bold, shape=octagon];
n07 [label="Decoding", style=bold, shape=box];
n08 [label="Lexicon", style=bold, shape=box];
n09 [label="HTK Files", style=bold, shape=octagon];
n10 [label="Signal Processing", style=bold, shape=box];
n00 -> n01;
n00 -> n02;
n03 -> n04;
n03 -> n05;
n06 -> n01;
n06 -> n05;
n04 -> n01;
n04 -> n05;
n07 -> n06;
n07 -> n04;
n07 -> n08;
n01 -> n02;
n01 -> n05;
n09 -> n00;
n09 -> n04;
n09 -> n08;
n08 -> n06;
n02 -> n05;
n10 -> n04;
}