Graphviz

Graph visualization is a way of representing structural information as diagrams of abstract graphs and networks. Automatic graph drawing has many important applications in software engineering, database and web design, networking, and in visual interfaces for many other domains.

语法

http://www.graphviz.org/documentation/

操作入口

示例

Clusters

digraph G {
 
  subgraph cluster_0 {
    style=filled;
    color=lightgrey;
    node [style=filled,color=white];
    a0 -> a1 -> a2 -> a3;
    label = "process #1";
  }
 
  subgraph cluster_1 {
    node [style=filled];
    b0 -> b1 -> b2 -> b3;
    label = "process #2";
    color=blue
  }
  start -> a0;
  start -> b0;
  a1 -> b3;
  b2 -> a3;
  a3 -> a0;
  a3 -> end;
  b3 -> end;
 
  start [shape=Mdiamond];
  end [shape=Msquare];
}

Data Structures

digraph g {
graph [
rankdir = "LR"
];
node [
fontsize = "16"
shape = "ellipse"
];
edge [
];
"node0" [
label = "<f0> 0x10ba8| <f1>"
shape = "record"
];
"node1" [
label = "<f0> 0xf7fc4380| <f1> | <f2> |-1"
shape = "record"
];
"node2" [
label = "<f0> 0xf7fc44b8| | |2"
shape = "record"
];
"node3" [
label = "<f0> 3.43322790286038071e-06|44.79998779296875|0"
shape = "record"
];
"node4" [
label = "<f0> 0xf7fc4380| <f1> | <f2> |2"
shape = "record"
];
"node5" [
label = "<f0> (nil)| | |-1"
shape = "record"
];
"node6" [
label = "<f0> 0xf7fc4380| <f1> | <f2> |1"
shape = "record"
];
"node7" [
label = "<f0> 0xf7fc4380| <f1> | <f2> |2"
shape = "record"
];
"node8" [
label = "<f0> (nil)| | |-1"
shape = "record"
];
"node9" [
label = "<f0> (nil)| | |-1"
shape = "record"
];
"node10" [
label = "<f0> (nil)| <f1> | <f2> |-1"
shape = "record"
];
"node11" [
label = "<f0> (nil)| <f1> | <f2> |-1"
shape = "record"
];
"node12" [
label = "<f0> 0xf7fc43e0| | |1"
shape = "record"
];
"node0":f0 -> "node1":f0 [
id = 0
];
"node0":f1 -> "node2":f0 [
id = 1
];
"node1":f0 -> "node3":f0 [
id = 2
];
"node1":f1 -> "node4":f0 [
id = 3
];
"node1":f2 -> "node5":f0 [
id = 4
];
"node4":f0 -> "node3":f0 [
id = 5
];
"node4":f1 -> "node6":f0 [
id = 6
];
"node4":f2 -> "node10":f0 [
id = 7
];
"node6":f0 -> "node3":f0 [
id = 8
];
"node6":f1 -> "node7":f0 [
id = 9
];
"node6":f2 -> "node9":f0 [
id = 10
];
"node7":f0 -> "node3":f0 [
id = 11
];
"node7":f1 -> "node1":f0 [
id = 12
];
"node7":f2 -> "node8":f0 [
id = 13
];
"node10":f1 -> "node11":f0 [
id = 14
];
"node10":f2 -> "node12":f0 [
id = 15
];
"node11":f2 -> "node1":f0 [
id = 16
];
}

fsm

digraph finite_state_machine {
  rankdir=LR;
  size="8,5"
  node [shape = doublecircle]; LR_0 LR_3 LR_4 LR_8;
  node [shape = circle];
  LR_0 -> LR_2 [ label = "SS(B)" ];
  LR_0 -> LR_1 [ label = "SS(S)" ];
  LR_1 -> LR_3 [ label = "S($end)" ];
  LR_2 -> LR_6 [ label = "SS(b)" ];
  LR_2 -> LR_5 [ label = "SS(a)" ];
  LR_2 -> LR_4 [ label = "S(A)" ];
  LR_5 -> LR_7 [ label = "S(b)" ];
  LR_5 -> LR_5 [ label = "S(a)" ];
  LR_6 -> LR_6 [ label = "S(b)" ];
  LR_6 -> LR_5 [ label = "S(a)" ];
  LR_7 -> LR_8 [ label = "S(b)" ];
  LR_7 -> LR_5 [ label = "S(a)" ];
  LR_8 -> LR_6 [ label = "S(b)" ];
  LR_8 -> LR_5 [ label = "S(a)" ];
}

UNIX Family 'Tree'

/* courtesy Ian Darwin and Geoff Collyer, Softquad Inc. */
digraph unix {
  size="6,6";
  node [color=lightblue2, style=filled];
  "5th Edition" -> "6th Edition";
  "5th Edition" -> "PWB 1.0";
  "6th Edition" -> "LSX";
  "6th Edition" -> "1 BSD";
  "6th Edition" -> "Mini Unix";
  "6th Edition" -> "Wollongong";
  "6th Edition" -> "Interdata";
  "Interdata" -> "Unix/TS 3.0";
  "Interdata" -> "PWB 2.0";
  "Interdata" -> "7th Edition";
  "7th Edition" -> "8th Edition";
  "7th Edition" -> "32V";
  "7th Edition" -> "V7M";
  "7th Edition" -> "Ultrix-11";
  "7th Edition" -> "Xenix";
  "7th Edition" -> "UniPlus+";
  "V7M" -> "Ultrix-11";
  "8th Edition" -> "9th Edition";
  "1 BSD" -> "2 BSD";
  "2 BSD" -> "2.8 BSD";
  "2.8 BSD" -> "Ultrix-11";
  "2.8 BSD" -> "2.9 BSD";
  "32V" -> "3 BSD";
  "3 BSD" -> "4 BSD";
  "4 BSD" -> "4.1 BSD";
  "4.1 BSD" -> "4.2 BSD";
  "4.1 BSD" -> "2.8 BSD";
  "4.1 BSD" -> "8th Edition";
  "4.2 BSD" -> "4.3 BSD";
  "4.2 BSD" -> "Ultrix-32";
  "PWB 1.0" -> "PWB 1.2";
  "PWB 1.0" -> "USG 1.0";
  "PWB 1.2" -> "PWB 2.0";
  "USG 1.0" -> "CB Unix 1";
  "USG 1.0" -> "USG 2.0";
  "CB Unix 1" -> "CB Unix 2";
  "CB Unix 2" -> "CB Unix 3";
  "CB Unix 3" -> "Unix/TS++";
  "CB Unix 3" -> "PDP-11 Sys V";
  "USG 2.0" -> "USG 3.0";
  "USG 3.0" -> "Unix/TS 3.0";
  "PWB 2.0" -> "Unix/TS 3.0";
  "Unix/TS 1.0" -> "Unix/TS 3.0";
  "Unix/TS 3.0" -> "TS 4.0";
  "Unix/TS++" -> "TS 4.0";
  "CB Unix 3" -> "TS 4.0";
  "TS 4.0" -> "System V.0";
  "System V.0" -> "System V.2";
  "System V.2" -> "System V.3";
}

world

digraph world {
size="7,7";
  {rank=same; S8 S24 S1 S35 S30;}
  {rank=same; T8 T24 T1 T35 T30;}
  {rank=same; 43 37 36 10 2;}
  {rank=same; 25 9 38 40 13 17 12 18;}
  {rank=same; 26 42 11 3 33 19 39 14 16;}
  {rank=same; 4 31 34 21 41 28 20;}
  {rank=same; 27 5 22 32 29 15;}
  {rank=same; 6 23;}
  {rank=same; 7;}
 
  S8 -> 9;
  S24 -> 25;
  S24 -> 27;
  S1 -> 2;
  S1 -> 10;
  S35 -> 43;
  S35 -> 36;
  S30 -> 31;
  S30 -> 33;
  9 -> 42;
  9 -> T1;
  25 -> T1;
  25 -> 26;
  27 -> T24;
  2 -> {3 ; 16 ; 17 ; T1 ; 18}
  10 -> { 11 ; 14 ; T1 ; 13; 12;}
  31 -> T1;
  31 -> 32;
  33 -> T30;
  33 -> 34;
  42 -> 4;
  26 -> 4;
  3 -> 4;
  16 -> 15;
  17 -> 19;
  18 -> 29;
  11 -> 4;
  14 -> 15;
  37 -> {39 ; 41 ; 38 ; 40;}
  13 -> 19;
  12 -> 29;
  43 -> 38;
  43 -> 40;
  36 -> 19;
  32 -> 23;
  34 -> 29;
  39 -> 15;
  41 -> 29;
  38 -> 4;
  40 -> 19;
  4 -> 5;
  19 -> {21 ; 20 ; 28;}
  5 -> {6 ; T35 ; 23;}
  21 -> 22;
  20 -> 15;
  28 -> 29;
  6 -> 7;
  15 -> T1;
  22 -> T35;
  22 -> 23;
  29 -> T30;
  7 -> T8;
  23 -> T24;
  23 -> T1;
}

Entity-Relation Data Model

Layouts made with neato have the property that all edges tend to have about the same length (unless there is a manual adjustment). By default neato uses randomization, so it makes a different layout each time, but this particular example almost always look well. Edge labels are placed at the edge's midpoint.

https://graphviz.gitlab.io/_pages/Gallery/undirected/ER.html

graph ER {
  node [shape=box]; course; institute; student;
  node [shape=ellipse]; {node [label="name"] name0; name1; name2;}
    code; grade; number;
  node [shape=diamond,style=filled,color=lightgrey]; "C-I"; "S-C"; "S-I";
 
  name0 -- course;
  code -- course;
  course -- "C-I" [label="n",len=1.00];
  "C-I" -- institute [label="1",len=1.00];
  institute -- name1;
  institute -- "S-I" [label="1",len=1.00];
  "S-I" -- student [label="n",len=1.00];
  student -- grade;
  student -- name2;
  student -- number;
  student -- "S-C" [label="m",len=1.00];
  "S-C" -- course [label="n",len=1.00];
 
  label = "\n\nEntity Relation Diagram\ndrawn by NEATO";
  fontsize=20;
}

若有收获，就赏束稻谷吧

0 颗稻谷