Dot Code (
guide
):
digraph G { // Group related nodes (use name cluster*). Can be nested. subgraph clusterLibStr { label=libStr; labeljust=l; bgcolor=thistle; node [style=filled,fillcolor=white] init; make_string; } // Define relationships. main -> parse -> execute [color=green]; main -> init; main -> cleanup; execute -> make_string [color=blue]; execute -> printf; init -> make_string; main -> printf [style=dashed]; execute -> compare; // Style some nodes. Can be done any time. main [shape=box,color=red]; compare [style=filled,fillcolor=lightblue]; }
Share It