Directed graph from data in DOT language
example 1
example 2
example 3
Draw
digraph { node [shape=circle fontSize=16] edge [length=100, color=gray, fontColor=black] A -> A[label=0.5]; B -> B[label=1.2] -> C[label=0.7] -- A; B -> D; D -> B; D -> C; D -> E[label=0.2]; F -> F; A [ fontColor=white, color=red, ] }
digraph topology { node[shape=circle fontSize=12] edge[length=170 fontSize=12] "10.0.255.1" -> "10.0.255.3"[label="1.000"]; "10.0.255.1" -> "10.0.255.2"[label="1.000"]; "10.0.255.1" -> "10.0.255.2"[label="1.000"]; "10.0.255.1" -> "10.0.255.3"[label="1.000"]; "10.0.255.2" -> "10.0.255.1"[label="1.000"]; "10.0.255.2" -> "10.0.255.3"[label="1.000"]; "10.0.255.3" -> "10.0.255.1"[label="1.000"]; "10.0.255.3" -> "10.0.255.2"[label="1.000"]; "10.0.255.3" -> "10.0.3.0/24"[label="HNA", shape=solid]; "10.0.3.0/24"[shape=rect]; "10.0.255.2" -> "10.0.2.0/24"[label="HNA"]; "10.0.2.0/24"[shape=rect]; "10.0.255.1" -> "10.0.1.0/24"[label="HNA"]; "10.0.1.0/24"[shape=rect]; }
digraph G { // note: not all attributes are recognized and supported by Network // unrecognized attributes are ignored node[width=.25,height=.375,fontsize=15] node [shape=filled fillcolor=#F1AAF0] 0-> 0 ; 1-> 1 ; 2-> 2 ; 3-> 3 ; 4-> 4 ; 5-> 5 ; 6-> 6 ; 7-> 5 ; 8-> 8 ; 9-> 9 ; 10-> 10 ; 11-> 10 ; 12-> 12 ; 13-> 5 ; 14-> 10 ; 15-> 0 ; }