n14 | 719 | }"];
9 | node2 [label = "{ a1 | 805 | }"];
10 | node3 [label = "{ i9 | 718 | }"];
11 | node4 [label = "{ e5 | 989 | }"];
12 | node5 [label = "{ t20 | 959 | }"] ;
13 | node6 [label = "{ o15 | 794 | }"] ;
14 | node7 [label = "{ s19 | 659 | }"] ;
15 |
16 | node0:f0 -> node1:n;
17 | node0:f1 -> node2:n;
18 | node0:f2 -> node3:n;
19 | node0:f5 -> node4:n;
20 | node0:f6 -> node5:n;
21 | node2:p -> node6:n;
22 | node4:p -> node7:n;
23 | }
24 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/japanese.gv:
--------------------------------------------------------------------------------
1 | digraph G {
2 | graph [label="下駄配列の派生図"]
3 |
4 | getas [label = "下駄配列"];
5 | new_getas [label = "新下駄配列"];
6 | getas_in_fine_weather [label = "日和下駄配列"];
7 | black_lacquered_getas [label = "黒塗り下駄配列"];
8 | black_lacquered_getas_made_of_paulownia [label = "黒塗り桐下駄配列"];
9 | lacquered_getas [label = "塗り下駄配列"];
10 | new_JIS_getas [label = "新JIS下駄配列"];
11 |
12 | getas -> {
13 | getas_in_fine_weather
14 | lacquered_getas
15 | new_JIS_getas new_getas
16 | lacquered_getas
17 | };
18 |
19 | lacquered_getas -> black_lacquered_getas;
20 | black_lacquered_getas -> black_lacquered_getas_made_of_paulownia;
21 | black_lacquered_getas_made_of_paulownia -> black_lacquered_getas;
22 |
23 | black_lacquered_getas -> getas_in_fine_weather [style = dotted];
24 | }
25 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/jcctree.gv:
--------------------------------------------------------------------------------
1 | digraph "tree" {
2 | // The problem disappeared when I removed the "ELEM3 -> ID5;" line!
3 | //size="4,5";
4 | ordering=out;
5 | node [shape=plaintext];
6 | SPEC -> DEF2;
7 | SPEC -> DEF1;
8 | DEF1 -> ID1;
9 | DEF1 -> SET1;
10 | DEF1 -> SC1;
11 | DEF2 -> ID2;
12 | DEF2 -> SET2;
13 | DEF2 -> SC2;
14 | SET1 -> OPEN1;
15 | SET1 -> ELEM1;
16 | SET1 -> SC3;
17 | SET1 -> ELEM2;
18 | SET1 -> CLOSE1;
19 | ELEM1 -> ID3;
20 | SET2 -> OPEN2;
21 | SET2 -> ELEM3;
22 | SET2 -> CLOSE2;
23 | ELEM2 -> ID4;
24 | ELEM3 -> ID5;
25 | DEF1 [label=DEF];
26 | DEF2 [label=DEF];
27 | SET1 [label=SET];
28 | SC1 [label=";"];
29 | SC3 [label=";"];
30 | SET2 [label=SET];
31 | SC2 [label=";"];
32 | OPEN1 [label="{"];
33 | OPEN2 [label="{"];
34 | CLOSE1 [label="}"];
35 | CLOSE2 [label="}"];
36 | ELEM1 [label=ELEMENT];
37 | ELEM2 [label=ELEMENT];
38 | ELEM3 [label=ELEMENT];
39 | ID1 [label=cities];
40 | ID2 [label=insects];
41 | ID3 [label=andover];
42 | ID4 [label=boston];
43 | ID5 [label=fly];
44 | }
45 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/longflat.gv:
--------------------------------------------------------------------------------
1 | digraph if
2 | {
3 | rankdir=LR;
4 | {rank=same;b;c;}
5 | a->b;
6 | c->b[label="long long long"];
7 | }
8 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/mike.gv:
--------------------------------------------------------------------------------
1 | digraph mike{
2 | size = "8,8";
3 | a -> A;
4 | a -> m;
5 | a -> E;
6 | t -> O;
7 | r -> V;
8 | r -> Q;
9 | p -> B;
10 | m -> R;
11 | l -> C;
12 | c -> C;
13 | W -> X;
14 | W -> D;
15 | V -> W;
16 | T -> U;
17 | Q -> T;
18 | Q -> H;
19 | Q -> A;
20 | O -> K;
21 | L -> U;
22 | K -> L;
23 | K -> J;
24 | K -> E;
25 | J -> I;
26 | R -> B;
27 | P -> F;
28 | H -> R;
29 | H -> P;
30 | U -> H;
31 | G -> U;
32 | E -> G;
33 | C -> Z;
34 | C -> D;
35 | S -> D;
36 | B -> N;
37 | B -> D;
38 | B -> S;
39 | M -> B;
40 | A -> M;
41 | N -> Y;
42 | }
43 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/nhg.gv:
--------------------------------------------------------------------------------
1 | digraph automata_0 {
2 | size ="8.5, 11";
3 | node [shape = circle];
4 | 0 [ style = filled, color=lightgrey ];
5 | 2 [ shape = doublecircle ];
6 | 0 -> 2 [ label = "a " ];
7 | 0 -> 1 [ label = "other " ];
8 | 1 -> 2 [ label = "a " ];
9 | 1 -> 1 [ label = "other " ];
10 | 2 -> 2 [ label = "a " ];
11 | 2 -> 1 [ label = "other " ];
12 | "Machine: a" [ shape = plaintext ];
13 | }
14 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/oldarrows.gv:
--------------------------------------------------------------------------------
1 | digraph G {
2 | // leave some space for the head/taillabels
3 | graph [ranksep=1.5 splines=true overlap=false]
4 |
5 | // to avoid confusion, remember this:
6 | // it's spelt tail/head, but it's read start/end
7 |
8 | // put head/tail labels farther from the node
9 | edge [labeldistance=3]
10 |
11 | // not interested in node labels
12 | node [shape=circle width=0.5 label=""]
13 |
14 | {
15 | edge [dir=back samehead=ahead samearrowhead=1]
16 | a->Z [arrowtail=none taillabel=none]
17 | b->Z [arrowtail=normal taillabel=normal]
18 | c->Z [arrowtail=inv taillabel=inv]
19 | d->Z [arrowtail=dot taillabel=dot]
20 | e->Z [arrowtail=odot taillabel=odot]
21 | f->Z [arrowtail=invdot taillabel=invdot]
22 | g->Z [arrowtail=invodot taillabel=invodot]
23 | h->Z [arrowtail=open taillabel=open]
24 | i->Z [arrowtail=halfopen taillabel=halfopen arrowhead=inv headlabel=samehead]
25 | j->Z [arrowtail=empty taillabel=empty]
26 | k->Z [arrowtail=invempty taillabel=invempty]
27 | l->Z [arrowtail=diamond taillabel=diamond]
28 | m->Z [arrowtail=odiamond taillabel=odiamond]
29 | n->Z [arrowtail=box taillabel=box]
30 | o->Z [arrowtail=obox taillabel=obox]
31 | p->Z [arrowtail=tee taillabel=tee]
32 | q->Z [arrowtail=crow taillabel=crow]
33 | }
34 | {
35 | edge [sametail=atail samearrowtail=1]
36 | Z->A [arrowhead=none headlabel=none]
37 | Z->B [arrowhead=normal headlabel=normal]
38 | Z->C [arrowhead=inv headlabel=inv]
39 | Z->D [arrowhead=dot headlabel=dot]
40 | Z->E [arrowhead=odot headlabel=odot]
41 | Z->F [arrowhead=invdot headlabel=invdot]
42 | Z->G [arrowhead=invodot headlabel=invodot]
43 | Z->H [arrowhead=open headlabel=open]
44 | Z->I [arrowhead=halfopen headlabel=halfopen arrowtail=inv taillabel=sametail]
45 | Z->J [arrowhead=empty headlabel=empty]
46 | Z->K [arrowhead=invempty headlabel=invempty]
47 | Z->L [arrowhead=diamond headlabel=diamond]
48 | Z->M [arrowhead=odiamond headlabel=odiamond]
49 | Z->N [arrowhead=box headlabel=box]
50 | Z->O [arrowhead=obox headlabel=obox]
51 | Z->P [arrowhead=tee headlabel=tee]
52 | Z->Q [arrowhead=crow headlabel=crow]
53 | }
54 | }
55 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/record2.gv:
--------------------------------------------------------------------------------
1 | digraph G {
2 | node [shape=record];
3 | a [label = " foo | x | bar"];
4 | b [label = "a | { foo | x | bar } | b"];
5 | a:f0 -> b:f1
6 | }
7 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/records.gv:
--------------------------------------------------------------------------------
1 | digraph G {
2 | rankdir=LR;
3 | node [shape=record];
4 | a [ label =" Graphs can\lbe fun\l| mid| right\r"];
5 | b [ label =" | b | " ];
6 | c [ label =" | c | " ];
7 | x [ label =" | x | " ];
8 | y [ label =" | y | " ];
9 | z [ label =" | z | " ];
10 | a:bala -> b:left;
11 | a:f1 -> d;
12 | a:f2 -> y:"p1";
13 | c:"p1" -> d;
14 | b:mid -> x:"p1";
15 | c:"p2" -> y:"p2";
16 | b:left -> z:"p2";
17 | }
18 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/rowe.gv:
--------------------------------------------------------------------------------
1 | digraph rowe {
2 | node [shape = box];
3 | size = "6,6";
4 | 1 -> 2;
5 | 1 -> 10;
6 | 10 -> 14;
7 | 10 -> 12;
8 | 10 -> 13;
9 | 10 -> 11;
10 | 2 -> 18;
11 | 2 -> 17;
12 | 2 -> 16;
13 | 2 -> 3;
14 | 11 -> 4;
15 | 16 -> 4;
16 | 3 -> 4;
17 | 4 -> 5;
18 | 13 -> 19;
19 | 17 -> 19;
20 | 5 -> 23;
21 | 5 -> 35;
22 | 5 -> 6;
23 | 37 -> 39;
24 | 37 -> 41;
25 | 37 -> 40;
26 | 37 -> 38;
27 | 19 -> 20;
28 | 19 -> 28;
29 | 19 -> 21;
30 | 12 -> 29;
31 | 18 -> 29;
32 | 41 -> 29;
33 | 28 -> 29;
34 | 29 -> 30;
35 | 30 -> 31;
36 | 30 -> 33;
37 | 31 -> 32;
38 | 21 -> 22;
39 | 32 -> 23;
40 | 22 -> 23;
41 | 6 -> 7;
42 | 23 -> 24;
43 | 7 -> 8;
44 | 24 -> 25;
45 | 24 -> 27;
46 | 35 -> 43;
47 | 35 -> 36;
48 | 8 -> 9;
49 | 14 -> 15;
50 | 39 -> 15;
51 | 20 -> 15;
52 | 33 -> 34;
53 | 43 -> 40;
54 | 43 -> 38;
55 | 25 -> 26;
56 | 9 -> 42;
57 | 10 -> 1;
58 | 15 -> 1;
59 | 23 -> 1;
60 | 31 -> 1;
61 | 2 -> 1;
62 | 25 -> 1;
63 | 9 -> 1;
64 | 38 -> 4;
65 | 26 -> 4;
66 | 42 -> 4;
67 | 40 -> 19;
68 | 36 -> 19;
69 | 34 -> 29;
70 | 33 -> 30;
71 | 27 -> 24;
72 | }
73 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/russian.gv:
--------------------------------------------------------------------------------
1 | digraph G {
2 | Контрагенты -> БанковскиеСчета;
3 | Организации -> БанковскиеСчета;
4 | ВопросыДляАнкетирования -> ВариантыОтветовОпросов;
5 | Контрагенты -> ДоговорыВзаиморасчетов;
6 | Номенклатура -> ЕдиницыИзмерения;
7 | НоменклатурныеГруппы -> ЕдиницыИзмерения;
8 | СвойстваОбектов -> ЗначенияСвойствОбектов;
9 | }
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/shells.gv:
--------------------------------------------------------------------------------
1 | digraph shells {
2 | size="7,8";
3 | node [fontsize=24, shape = plaintext];
4 |
5 | 1972 -> 1976;
6 | 1976 -> 1978;
7 | 1978 -> 1980;
8 | 1980 -> 1982;
9 | 1982 -> 1984;
10 | 1984 -> 1986;
11 | 1986 -> 1988;
12 | 1988 -> 1990;
13 | 1990 -> future;
14 |
15 | node [fontsize=20, shape = box];
16 | { rank=same; 1976 Mashey Bourne; }
17 | { rank=same; 1978 Formshell csh; }
18 | { rank=same; 1980 esh vsh; }
19 | { rank=same; 1982 ksh "System-V"; }
20 | { rank=same; 1984 v9sh tcsh; }
21 | { rank=same; 1986 "ksh-i"; }
22 | { rank=same; 1988 KornShell Perl rc; }
23 | { rank=same; 1990 tcl Bash; }
24 | { rank=same; "future" POSIX "ksh-POSIX"; }
25 |
26 | Thompson -> Mashey;
27 | Thompson -> Bourne;
28 | Thompson -> csh;
29 | csh -> tcsh;
30 | Bourne -> ksh;
31 | Bourne -> esh;
32 | Bourne -> vsh;
33 | Bourne -> "System-V";
34 | Bourne -> v9sh;
35 | v9sh -> rc;
36 | Bourne -> Bash;
37 | "ksh-i" -> Bash;
38 | KornShell -> Bash;
39 | esh -> ksh;
40 | vsh -> ksh;
41 | Formshell -> ksh;
42 | csh -> ksh;
43 | KornShell -> POSIX;
44 | "System-V" -> POSIX;
45 | ksh -> "ksh-i";
46 | "ksh-i" -> KornShell;
47 | KornShell -> "ksh-POSIX";
48 | Bourne -> Formshell;
49 |
50 | edge [style=invis];
51 | 1984 -> v9sh -> tcsh ;
52 | 1988 -> rc -> KornShell;
53 | Formshell -> csh;
54 | KornShell -> Perl;
55 | }
56 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/states.gv:
--------------------------------------------------------------------------------
1 | /*
2 | The command line is
3 |
4 | dot -Tps -Grankdir=LR states.gv > states.ps
5 |
6 | and the file is:
7 | */
8 | digraph states {
9 | size="3,2";
10 | rankdir=LR;
11 | node [shape=ellipse];
12 | empty [label = "Empty"];
13 | stolen [label = "Stolen"];
14 | waiting [label = "Waiting"];
15 | full [label = "Full"];
16 | empty -> full [label = "return"]
17 | empty -> stolen [label = "dispatch", wt=28]
18 | stolen -> full [label = "return"];
19 | stolen -> waiting [label = "touch"];
20 | waiting -> full [label = "return"];
21 | }
22 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/structs.gv:
--------------------------------------------------------------------------------
1 | digraph structs {
2 | node [shape=record];
3 | struct1 [shape=record,label=" left| middle| right"];
4 | struct2 [shape=record,label=" one| two"];
5 | struct3 [shape=record,label="hello\nworld |{ b |{c| d|e}| f}| g | h"];
6 | struct1:f1 -> struct2:f0;
7 | struct1:f2 -> struct3:here;
8 | }
9 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/switch.gv:
--------------------------------------------------------------------------------
1 | digraph G {
2 | graph [center=true rankdir=LR bgcolor="#808080"]
3 | edge [dir=none]
4 | node [width=0.3 height=0.3 label=""]
5 | { node [shape=circle style=invis]
6 | 1 2 3 4 5 6 7 8 10 20 30 40 50 60 70 80
7 | }
8 | { node [shape=circle]
9 | a b c d e f g h i j k l m n o p q r s t u v w x
10 | }
11 | { node [shape=diamond]
12 | A B C D E F G H I J K L M N O P Q R S T U V W X
13 | }
14 | 1 -> a -> {A B} [color="#0000ff"]
15 | 2 -> b -> {B A} [color="#ff0000"]
16 | 3 -> c -> {C D} [color="#ffff00"]
17 | 4 -> d -> {D C} [color="#00ff00"]
18 | 5 -> e -> {E F} [color="#000000"]
19 | 6 -> f -> {F E} [color="#00ffff"]
20 | 7 -> g -> {G H} [color="#ffffff"]
21 | 8 -> h -> {H G} [color="#ff00ff"]
22 | { edge [color="#ff0000:#0000ff"]
23 | A -> i -> {I K}
24 | B -> j -> {J L}
25 | }
26 | { edge [color="#00ff00:#ffff00"]
27 | C -> k -> {K I}
28 | D -> l -> {L J}
29 | }
30 | { edge [color="#00ffff:#000000"]
31 | E -> m -> {M O}
32 | F -> n -> {N P}
33 | }
34 | { edge [color="#ff00ff:#ffffff"]
35 | G -> o -> {O M}
36 | H -> p -> {P N}
37 | }
38 | { edge [color="#00ff00:#ffff00:#ff0000:#0000ff"]
39 | I -> q -> {Q U}
40 | J -> r -> {R V}
41 | K -> s -> {S W}
42 | L -> t -> {T X}
43 | }
44 | { edge [color="#ff00ff:#ffffff:#00ffff:#000000"]
45 | M -> u -> {U Q}
46 | N -> v -> {V R}
47 | O -> w -> {W S}
48 | P -> x -> {X T}
49 | }
50 | { edge [color="#ff00ff:#ffffff:#00ffff:#000000:#00ff00:#ffff00:#ff0000:#0000ff"]
51 | Q -> 10
52 | R -> 20
53 | S -> 30
54 | T -> 40
55 | U -> 50
56 | V -> 60
57 | W -> 70
58 | X -> 80
59 | }
60 | }
61 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/table.gv:
--------------------------------------------------------------------------------
1 | digraph structs {
2 | node [shape=plaintext];
3 |
4 | struct1 [label=<
5 |
6 | | a |
7 | b |
8 | c |
9 |
10 |
>];
11 |
12 | struct2 [label=<
13 |
14 | | elefantel |
15 | two |
16 |
17 |
18 |
19 | | buca |
20 |
21 | | c |
22 |
23 | | f |
24 |
25 | |
26 | patratos |
27 |
28 | | 4 |
29 |
30 |
31 | >];
32 |
33 | struct3 [label=<
34 |
35 | | Hello |
36 |
37 |
38 | | b |
39 |
40 | | a |
41 | dino |
42 | y |
43 |
44 | | rhino |
45 |
46 | |
47 |
48 | | climb |
49 | Up |
50 |
51 | | low |
52 |
53 |
>];
54 |
55 | struct1 -> struct3;
56 | struct1 -> struct2;
57 | }
58 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/train11.gv:
--------------------------------------------------------------------------------
1 | digraph G {
2 | size="6,6";
3 | node [shape=circle,fontsize=8];
4 | rankdir=LR;
5 | st9 -> st9 [label="11/1"];
6 | st9 -> st10 [label="10/1"];
7 | st8 -> st8 [label="10/1"];
8 | st8 -> st0 [label="00/-"];
9 | st7 -> st8 [label="10/1"];
10 | st7 -> st7 [label="00/1"];
11 | st6 -> st6 [label="01/1"];
12 | st6 -> st0 [label="00/-"];
13 | st5 -> st6 [label="01/1"];
14 | st5 -> st5 [label="11/1"];
15 | st4 -> st4 [label="01/1"];
16 | st4 -> st0 [label="00/-"];
17 | st3 -> st4 [label="01/1"];
18 | st3 -> st3 [label="00/1"];
19 | st2 -> st9 [label="11/1"];
20 | st2 -> st7 [label="00/1"];
21 | st2 -> st2 [label="01/1"];
22 | st10 -> st10 [label="10/1"];
23 | st10 -> st0 [label="00/-"];
24 | st1 -> st5 [label="11/1"];
25 | st1 -> st3 [label="00/1"];
26 | st1 -> st1 [label="10/1"];
27 | st0 -> st2 [label="01/-"];
28 | st0 -> st1 [label="10/-"];
29 | st0 -> st0 [label="00/0"];
30 | }
31 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/trapeziumlr.gv:
--------------------------------------------------------------------------------
1 | digraph test {
2 |
3 | size="7,9.5";
4 | page="8,10.5";
5 | ratio=fill;
6 | rankdir=LR;
7 |
8 | { rank=same;
9 | node [shape=house];
10 | A;C;E;G;I;K;M;O;Q;S;U;W;Y;
11 | node [shape=invhouse];
12 | B;D;F;H;J;L;N;P;R;T;V;X;Z;
13 | }
14 |
15 | { rank=same;
16 | node [shape=trapezium];
17 | "Trapezium";
18 | ordering=out;
19 | }
20 |
21 | Trapezium -> A;
22 | Trapezium -> B;
23 | Trapezium -> C;
24 | Trapezium -> D;
25 | Trapezium -> E;
26 | Trapezium -> F;
27 | Trapezium -> G;
28 | Trapezium -> H;
29 | Trapezium -> I;
30 | Trapezium -> J;
31 | Trapezium -> K;
32 | Trapezium -> L;
33 | Trapezium -> M;
34 | Trapezium -> N;
35 | Trapezium -> O;
36 | Trapezium -> P;
37 | Trapezium -> Q;
38 | Trapezium -> R;
39 | Trapezium -> S;
40 | Trapezium -> T;
41 | Trapezium -> U;
42 | Trapezium -> V;
43 | Trapezium -> W;
44 | Trapezium -> X;
45 | Trapezium -> Y;
46 | Trapezium -> Z;
47 |
48 | { rank=same;
49 | node [shape=parallelogram];
50 | a;b;c;d;e;f;g;h;i;j;k;l;m;n;o;p;q;r;s;t;u;v;w;x;y;z;
51 | }
52 |
53 | a -> Trapezium;
54 | b -> Trapezium;
55 | c -> Trapezium;
56 | d -> Trapezium;
57 | e -> Trapezium;
58 | f -> Trapezium;
59 | g -> Trapezium;
60 | h -> Trapezium;
61 | i -> Trapezium;
62 | j -> Trapezium;
63 | k -> Trapezium;
64 | l -> Trapezium;
65 | m -> Trapezium;
66 | n -> Trapezium;
67 | o -> Trapezium;
68 | p -> Trapezium;
69 | q -> Trapezium;
70 | r -> Trapezium;
71 | s -> Trapezium;
72 | t -> Trapezium;
73 | u -> Trapezium;
74 | v -> Trapezium;
75 | w -> Trapezium;
76 | x -> Trapezium;
77 | y -> Trapezium;
78 | z -> Trapezium;
79 | }
80 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/tree.gv:
--------------------------------------------------------------------------------
1 | digraph g {
2 | node [shape = record,height=.1];
3 | node0[label = " | G| "];
4 | node1[label = " | E| "];
5 | node2[label = " | B| "];
6 | node3[label = " | F| "];
7 | node4[label = " | R| "];
8 | node5[label = " | H| "];
9 | node6[label = " | Y| "];
10 | node7[label = " | A| "];
11 | node8[label = " | C| "];
12 | "node0":f2 -> "node4":f1;
13 | "node0":f0 -> "node1":f1;
14 | "node1":f0 -> "node2":f1;
15 | "node1":f2 -> "node3":f1;
16 | "node2":f2 -> "node8":f1;
17 | "node2":f0 -> "node7":f1;
18 | "node4":f2 -> "node6":f1;
19 | "node4":f0 -> "node5":f1;
20 | }
21 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/triedds.gv:
--------------------------------------------------------------------------------
1 | digraph g {
2 | graph [
3 | rankdir = "LR"
4 | ];
5 | node [
6 | fontsize = "16"
7 | shape = "ellipse"
8 | ];
9 | edge [
10 | ];
11 | "node0" [
12 | label = " 0x10ba8| "
13 | shape = "record"
14 | ];
15 | "node1" [
16 | label = " 0xf7fc4380| | |-1"
17 | shape = "record"
18 | ];
19 | "node2" [
20 | label = " 0xf7fc44b8| | |2"
21 | shape = "record"
22 | ];
23 | "node3" [
24 | label = " 3.43322790286038071e-06|44.79998779296875|0"
25 | shape = "record"
26 | ];
27 | "node4" [
28 | label = " 0xf7fc4380| | |2"
29 | shape = "record"
30 | ];
31 | "node5" [
32 | label = " (nil)| | |-1"
33 | shape = "record"
34 | ];
35 | "node6" [
36 | label = " 0xf7fc4380| | |1"
37 | shape = "record"
38 | ];
39 | "node7" [
40 | label = " 0xf7fc4380| | |2"
41 | shape = "record"
42 | ];
43 | "node8" [
44 | label = " (nil)| | |-1"
45 | shape = "record"
46 | ];
47 | "node9" [
48 | label = " (nil)| | |-1"
49 | shape = "record"
50 | ];
51 | "node10" [
52 | label = " (nil)| | |-1"
53 | shape = "record"
54 | ];
55 | "node11" [
56 | label = " (nil)| | |-1"
57 | shape = "record"
58 | ];
59 | "node12" [
60 | label = " 0xf7fc43e0| | |1"
61 | shape = "record"
62 | ];
63 | "node0":f0 -> "node1":f0 [
64 | id = 0
65 | ];
66 | "node0":f1 -> "node2":f0 [
67 | id = 1
68 | ];
69 | "node1":f0 -> "node3":f0 [
70 | id = 2
71 | ];
72 | "node1":f1 -> "node4":f0 [
73 | id = 3
74 | ];
75 | "node1":f2 -> "node5":f0 [
76 | id = 4
77 | ];
78 | "node4":f0 -> "node3":f0 [
79 | id = 5
80 | ];
81 | "node4":f1 -> "node6":f0 [
82 | id = 6
83 | ];
84 | "node4":f2 -> "node10":f0 [
85 | id = 7
86 | ];
87 | "node6":f0 -> "node3":f0 [
88 | id = 8
89 | ];
90 | "node6":f1 -> "node7":f0 [
91 | id = 9
92 | ];
93 | "node6":f2 -> "node9":f0 [
94 | id = 10
95 | ];
96 | "node7":f0 -> "node3":f0 [
97 | id = 11
98 | ];
99 | "node7":f1 -> "node1":f0 [
100 | id = 12
101 | ];
102 | "node7":f2 -> "node8":f0 [
103 | id = 13
104 | ];
105 | "node10":f1 -> "node11":f0 [
106 | id = 14
107 | ];
108 | "node10":f2 -> "node12":f0 [
109 | id = 15
110 | ];
111 | "node11":f2 -> "node1":f0 [
112 | id = 16
113 | ];
114 | }
115 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/try.gv:
--------------------------------------------------------------------------------
1 | digraph G {
2 | subgraph cluster_small {
3 | a -> b;
4 | label=small;
5 | }
6 |
7 | subgraph cluster_big {
8 | p -> q -> r -> s -> t;
9 | label=big;
10 | t -> p;
11 | }
12 |
13 | t -> a;
14 | b -> q;
15 | }
16 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/unix.gv:
--------------------------------------------------------------------------------
1 | /* courtesy Ian Darwin and Geoff Collyer, Softquad Inc. */
2 | digraph unix {
3 | size="6,6";
4 | "5th Edition" -> "6th Edition";
5 | "5th Edition" -> "PWB 1.0";
6 | "6th Edition" -> "LSX";
7 | "6th Edition" -> "1 BSD";
8 | "6th Edition" -> "Mini Unix";
9 | "6th Edition" -> "Wollongong";
10 | "6th Edition" -> "Interdata";
11 | "Interdata" -> "Unix/TS 3.0";
12 | "Interdata" -> "PWB 2.0";
13 | "Interdata" -> "7th Edition";
14 | "7th Edition" -> "8th Edition";
15 | "7th Edition" -> "32V";
16 | "7th Edition" -> "V7M";
17 | "7th Edition" -> "Ultrix-11";
18 | "7th Edition" -> "Xenix";
19 | "7th Edition" -> "UniPlus+";
20 | "V7M" -> "Ultrix-11";
21 | "8th Edition" -> "9th Edition";
22 | "1 BSD" -> "2 BSD";
23 | "2 BSD" -> "2.8 BSD";
24 | "2.8 BSD" -> "Ultrix-11";
25 | "2.8 BSD" -> "2.9 BSD";
26 | "32V" -> "3 BSD";
27 | "3 BSD" -> "4 BSD";
28 | "4 BSD" -> "4.1 BSD";
29 | "4.1 BSD" -> "4.2 BSD";
30 | "4.1 BSD" -> "2.8 BSD";
31 | "4.1 BSD" -> "8th Edition";
32 | "4.2 BSD" -> "4.3 BSD";
33 | "4.2 BSD" -> "Ultrix-32";
34 | "PWB 1.0" -> "PWB 1.2";
35 | "PWB 1.0" -> "USG 1.0";
36 | "PWB 1.2" -> "PWB 2.0";
37 | "USG 1.0" -> "CB Unix 1";
38 | "USG 1.0" -> "USG 2.0";
39 | "CB Unix 1" -> "CB Unix 2";
40 | "CB Unix 2" -> "CB Unix 3";
41 | "CB Unix 3" -> "Unix/TS++";
42 | "CB Unix 3" -> "PDP-11 Sys V";
43 | "USG 2.0" -> "USG 3.0";
44 | "USG 3.0" -> "Unix/TS 3.0";
45 | "PWB 2.0" -> "Unix/TS 3.0";
46 | "Unix/TS 1.0" -> "Unix/TS 3.0";
47 | "Unix/TS 3.0" -> "TS 4.0";
48 | "Unix/TS++" -> "TS 4.0";
49 | "CB Unix 3" -> "TS 4.0";
50 | "TS 4.0" -> "System V.0";
51 | "System V.0" -> "System V.2";
52 | "System V.2" -> "System V.3";
53 | }
54 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/unix2.gv:
--------------------------------------------------------------------------------
1 | /* Courtesy of Ian Darwin
2 | * and Geoff Collyer
3 | * Mildly updated by Ian Darwin in 2000.
4 | */
5 | digraph unix {
6 | size="6,6";
7 | node [color=lightblue2, style=filled];
8 | "5th Edition" -> "6th Edition";
9 | "5th Edition" -> "PWB 1.0";
10 | "6th Edition" -> "LSX";
11 | "6th Edition" -> "1 BSD";
12 | "6th Edition" -> "Mini Unix";
13 | "6th Edition" -> "Wollongong";
14 | "6th Edition" -> "Interdata";
15 | "Interdata" -> "Unix/TS 3.0";
16 | "Interdata" -> "PWB 2.0";
17 | "Interdata" -> "7th Edition";
18 | "7th Edition" -> "8th Edition";
19 | "7th Edition" -> "32V";
20 | "7th Edition" -> "V7M";
21 | "7th Edition" -> "Ultrix-11";
22 | "7th Edition" -> "Xenix";
23 | "7th Edition" -> "UniPlus+";
24 | "V7M" -> "Ultrix-11";
25 | "8th Edition" -> "9th Edition";
26 | "9th Edition" -> "10th Edition";
27 | "1 BSD" -> "2 BSD";
28 | "2 BSD" -> "2.8 BSD";
29 | "2.8 BSD" -> "Ultrix-11";
30 | "2.8 BSD" -> "2.9 BSD";
31 | "32V" -> "3 BSD";
32 | "3 BSD" -> "4 BSD";
33 | "4 BSD" -> "4.1 BSD";
34 | "4.1 BSD" -> "4.2 BSD";
35 | "4.1 BSD" -> "2.8 BSD";
36 | "4.1 BSD" -> "8th Edition";
37 | "4.2 BSD" -> "4.3 BSD";
38 | "4.2 BSD" -> "Ultrix-32";
39 | "4.3 BSD" -> "4.4 BSD";
40 | "4.4 BSD" -> "FreeBSD";
41 | "4.4 BSD" -> "NetBSD";
42 | "4.4 BSD" -> "OpenBSD";
43 | "PWB 1.0" -> "PWB 1.2";
44 | "PWB 1.0" -> "USG 1.0";
45 | "PWB 1.2" -> "PWB 2.0";
46 | "USG 1.0" -> "CB Unix 1";
47 | "USG 1.0" -> "USG 2.0";
48 | "CB Unix 1" -> "CB Unix 2";
49 | "CB Unix 2" -> "CB Unix 3";
50 | "CB Unix 3" -> "Unix/TS++";
51 | "CB Unix 3" -> "PDP-11 Sys V";
52 | "USG 2.0" -> "USG 3.0";
53 | "USG 3.0" -> "Unix/TS 3.0";
54 | "PWB 2.0" -> "Unix/TS 3.0";
55 | "Unix/TS 1.0" -> "Unix/TS 3.0";
56 | "Unix/TS 3.0" -> "TS 4.0";
57 | "Unix/TS++" -> "TS 4.0";
58 | "CB Unix 3" -> "TS 4.0";
59 | "TS 4.0" -> "System V.0";
60 | "System V.0" -> "System V.2";
61 | "System V.2" -> "System V.3";
62 | "System V.3" -> "System V.4";
63 | }
64 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/viewfile.gv:
--------------------------------------------------------------------------------
1 | digraph Viewfile {
2 | node [ style = filled ];
3 | atoi [color=green];
4 | chkmalloc [color=green];
5 | close [color=green];
6 | error [color=blue];
7 | exit [color=blue];
8 | fclose [color=green];
9 | fgets [color=red];
10 | fopen [color=green];
11 | fprintf [color=blue];
12 | free [color=blue];
13 | free_list [color=blue];
14 | fstat [color=green];
15 | getopt [color=green];
16 | init_list [color=green];
17 | insert_list [color=green];
18 | main [color=green];
19 | makeargs [color=blue];
20 | makepairs [color=green];
21 | malloc [color=green];
22 | open [color=green];
23 | printf [color=red];
24 | read [color=green];
25 | rewind [color=green];
26 | viewline [color=green];
27 | viewlines [color=green];
28 | walk_list [color=green];
29 | write [color=green];
30 | fclose -> close [color=green];
31 | fgets -> fstat [color=green];
32 | fgets -> read [color=green];
33 | fopen -> open [color=green];
34 | printf -> write [color=green];
35 | main -> fgets [color=blue];
36 | main -> getopt [color=green];
37 | main -> makeargs [color=blue];
38 | main -> makepairs [color=green];
39 | main -> chkmalloc [color=green];
40 | main -> error [color=blue];
41 | main -> viewlines [color=green];
42 | makeargs -> chkmalloc [color=blue];
43 | makepairs -> atoi [color=green];
44 | makepairs -> init_list [color=green];
45 | makepairs -> insert_list [color=green];
46 | makepairs -> chkmalloc [color=green];
47 | free_list -> free [color=blue];
48 | init_list -> chkmalloc [color=green];
49 | insert_list -> chkmalloc [color=green];
50 | walk_list -> error [color=blue];
51 | walk_list -> viewline [color=green];
52 | chkmalloc -> malloc [color=green];
53 | chkmalloc -> error [color=blue];
54 | error -> exit [color=blue];
55 | error -> fprintf [color=blue];
56 | error -> error [color=blue];
57 | viewline -> fgets [color=red];
58 | viewline -> printf [color=red];
59 | viewline -> rewind [color=green];
60 | viewlines -> fclose [color=green];
61 | viewlines -> fopen [color=green];
62 | viewlines -> walk_list [color=green];
63 | viewlines -> viewline [color=blue];
64 | }
65 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/directed/world.gv:
--------------------------------------------------------------------------------
1 | digraph world {
2 | size="7,7";
3 | {rank=same; S8 S24 S1 S35 S30;}
4 | {rank=same; T8 T24 T1 T35 T30;}
5 | {rank=same; 43 37 36 10 2;}
6 | {rank=same; 25 9 38 40 13 17 12 18;}
7 | {rank=same; 26 42 11 3 33 19 39 14 16;}
8 | {rank=same; 4 31 34 21 41 28 20;}
9 | {rank=same; 27 5 22 32 29 15;}
10 | {rank=same; 6 23;}
11 | {rank=same; 7;}
12 |
13 | S8 -> 9;
14 | S24 -> 25;
15 | S24 -> 27;
16 | S1 -> 2;
17 | S1 -> 10;
18 | S35 -> 43;
19 | S35 -> 36;
20 | S30 -> 31;
21 | S30 -> 33;
22 | 9 -> 42;
23 | 9 -> T1;
24 | 25 -> T1;
25 | 25 -> 26;
26 | 27 -> T24;
27 | 2 -> {3 ; 16 ; 17 ; T1 ; 18}
28 | 10 -> { 11 ; 14 ; T1 ; 13; 12;}
29 | 31 -> T1;
30 | 31 -> 32;
31 | 33 -> T30;
32 | 33 -> 34;
33 | 42 -> 4;
34 | 26 -> 4;
35 | 3 -> 4;
36 | 16 -> 15;
37 | 17 -> 19;
38 | 18 -> 29;
39 | 11 -> 4;
40 | 14 -> 15;
41 | 37 -> {39 ; 41 ; 38 ; 40;}
42 | 13 -> 19;
43 | 12 -> 29;
44 | 43 -> 38;
45 | 43 -> 40;
46 | 36 -> 19;
47 | 32 -> 23;
48 | 34 -> 29;
49 | 39 -> 15;
50 | 41 -> 29;
51 | 38 -> 4;
52 | 40 -> 19;
53 | 4 -> 5;
54 | 19 -> {21 ; 20 ; 28;}
55 | 5 -> {6 ; T35 ; 23;}
56 | 21 -> 22;
57 | 20 -> 15;
58 | 28 -> 29;
59 | 6 -> 7;
60 | 15 -> T1;
61 | 22 -> T35;
62 | 22 -> 23;
63 | 29 -> T30;
64 | 7 -> T8;
65 | 23 -> T24;
66 | 23 -> T1;
67 | }
68 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/undirected/ER.gv:
--------------------------------------------------------------------------------
1 | graph ER {
2 | node [shape=box]; course; institute; student;
3 | node [shape=ellipse]; {node [label="name"] name0; name1; name2;}
4 | code; grade; number;
5 | node [shape=diamond,style=filled,color=lightgrey]; "C-I"; "S-C"; "S-I";
6 |
7 | name0 -- course;
8 | code -- course;
9 | course -- "C-I" [label="n",len=1.00];
10 | "C-I" -- institute [label="1",len=1.00];
11 | institute -- name1;
12 | institute -- "S-I" [label="1",len=1.00];
13 | "S-I" -- student [label="n",len=1.00];
14 | student -- grade;
15 | student -- name2;
16 | student -- number;
17 | student -- "S-C" [label="m",len=1.00];
18 | "S-C" -- course [label="n",len=1.00];
19 |
20 | label = "\n\nEntity Relation Diagram\ndrawn by NEATO";
21 | fontsize=20;
22 | }
23 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/undirected/Heawood.gv:
--------------------------------------------------------------------------------
1 | /*
2 | * The transitive 6-net, also known as Heawood's graph,
3 | * can be used to test the "stability points" of the layout
4 | * algorithm.
5 |
6 | * The "ideal" layout occurs when len="2.5". The layout
7 | * loses the regularity when smaller values are used.
8 | */
9 | graph "Heawood" {
10 | node [
11 | fontname = "Arial"
12 | label = "\N"
13 | shape = "circle"
14 | width = "0.50000"
15 | height = "0.500000"
16 | color = "black"
17 | ]
18 | edge [
19 | color = "black"
20 | ]
21 | /* The outer wheel */
22 | "0" -- "1" -- "2" -- "3" -- "4" -- "5" -- "6" -- "7" -- "8" -- "9" -- "10" -- "11" -- "12" -- "13" -- "0";
23 | /* The internal edges. The len = makes them internal */
24 | "0" -- "5" [len = 2.5];
25 | "2" -- "7" [len = 2.5];
26 | "4" -- "9" [len = 2.5];
27 | "6" -- "11" [len = 2.5];
28 | "8" -- "13" [len = 2.5];
29 | "10" -- "1" [len = 2.5];
30 | "12" -- "3" [len = 2.5];
31 | }
32 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/undirected/Petersen.gv:
--------------------------------------------------------------------------------
1 | /*
2 | * The transitive 5-net, also known as Petersen's graph,
3 | * can be used to test the "stability points" of the layout
4 | * algorithm.
5 | *
6 | * The "ideal" layout is achieved for certain random seed
7 | * values when len=1.5. For len=2.5 or above, the layout
8 | * is stable. Sometimes, the graph is rendered "inside-out".
9 | */
10 | graph "Petersen" {
11 | node [
12 | fontname = "Arial"
13 | label = "\N"
14 | shape = "circle"
15 | width = "0.400000"
16 | height = "0.400000"
17 | color = "black"
18 | ]
19 | edge [
20 | color = "black"
21 | ]
22 | /* Outer wheel. The len= is what makes it outer */
23 | "0" -- "1" -- "2" -- "3" -- "4" -- "0" [
24 | color = "blue"
25 | len = 2.6
26 | ]
27 | "0" -- "5" [
28 | color = "red"
29 | weight = "5"
30 | ]
31 | "1" -- "6" [
32 | color = "red"
33 | weight = "5"
34 | ]
35 | "2" -- "7" [
36 | color = "red"
37 | weight = "5"
38 | ]
39 | "3" -- "8" [
40 | color = "red"
41 | weight = "5"
42 | ]
43 | "4" -- "9" [
44 | color = "red"
45 | weight = "5"
46 | ]
47 | "5" -- "7" -- "9" -- "6" -- "8" -- "5";
48 | }
49 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/undirected/ngk10_4.gv:
--------------------------------------------------------------------------------
1 | graph G {
2 | graph [splines=true overlap=false]
3 | 1 -- 30 [f=1];
4 | 1 -- 40 [f=14];
5 | 8 -- 46 [f=1];
6 | 8 -- 16 [f=18];
7 | 10 -- 25 [f=1];
8 | 10 -- 19 [f=5];
9 | 10 -- 33 [f=1];
10 | 12 -- 8 [f=1];
11 | 12 -- 36 [f=5];
12 | 12 -- 17 [f=16];
13 | 13 -- 38 [f=1];
14 | 13 -- 24 [f=19];
15 | 24 -- 49 [f=1];
16 | 24 -- 13 [f=1];
17 | 24 -- 47 [f=12];
18 | 24 -- 12 [f=19];
19 | 25 -- 27 [f=1];
20 | 25 -- 12 [f=1];
21 | 27 -- 12 [f=1];
22 | 27 -- 14 [f=8];
23 | 29 -- 10 [f=1];
24 | 29 -- 8 [f=17];
25 | 30 -- 24 [f=1];
26 | 30 -- 44 [f=15];
27 | 38 -- 29 [f=1];
28 | 38 -- 35 [f=15];
29 | 2 -- 42 [f=2];
30 | 2 -- 35 [f=3];
31 | 2 -- 11 [f=19];
32 | 14 -- 18 [f=2];
33 | 14 -- 24 [f=15];
34 | 14 -- 38 [f=18];
35 | 18 -- 49 [f=2];
36 | 18 -- 47 [f=20];
37 | 26 -- 41 [f=2];
38 | 26 -- 42 [f=15];
39 | 31 -- 39 [f=2];
40 | 31 -- 47 [f=17];
41 | 31 -- 25 [f=14];
42 | 37 -- 26 [f=2];
43 | 37 -- 16 [f=14];
44 | 39 -- 50 [f=2];
45 | 39 -- 14 [f=2];
46 | 39 -- 18 [f=17];
47 | 39 -- 47 [f=10];
48 | 41 -- 31 [f=2];
49 | 41 -- 8 [f=16];
50 | 42 -- 44 [f=2];
51 | 42 -- 29 [f=12];
52 | 44 -- 37 [f=2];
53 | 44 -- 32 [f=15];
54 | 3 -- 20 [f=2];
55 | 3 -- 28 [f=19];
56 | 6 -- 45 [f=2];
57 | 6 -- 28 [f=10];
58 | 9 -- 6 [f=2];
59 | 9 -- 16 [f=1];
60 | 15 -- 16 [f=2];
61 | 15 -- 48 [f=2];
62 | 16 -- 50 [f=2];
63 | 16 -- 32 [f=14];
64 | 16 -- 39 [f=8];
65 | 20 -- 33 [f=2];
66 | 33 -- 9 [f=2];
67 | 33 -- 46 [f=3];
68 | 33 -- 48 [f=17];
69 | 45 -- 15 [f=2];
70 | 4 -- 17 [f=4];
71 | 4 -- 15 [f=6];
72 | 4 -- 12 [f=16];
73 | 17 -- 21 [f=4];
74 | 19 -- 35 [f=4];
75 | 19 -- 15 [f=9];
76 | 19 -- 43 [f=4];
77 | 21 -- 19 [f=4];
78 | 21 -- 50 [f=4];
79 | 23 -- 36 [f=4];
80 | 34 -- 23 [f=4];
81 | 34 -- 24 [f=11];
82 | 35 -- 34 [f=4];
83 | 35 -- 16 [f=6];
84 | 35 -- 18 [f=16];
85 | 36 -- 46 [f=4];
86 | 5 -- 7 [f=1];
87 | 5 -- 36 [f=6];
88 | 7 -- 32 [f=1];
89 | 7 -- 11 [f=2];
90 | 7 -- 14 [f=17];
91 | 11 -- 40 [f=1];
92 | 11 -- 50 [f=1];
93 | 22 -- 46 [f=1];
94 | 28 -- 43 [f=1];
95 | 28 -- 8 [f=18];
96 | 32 -- 28 [f=1];
97 | 32 -- 39 [f=13];
98 | 32 -- 42 [f=15];
99 | 40 -- 22 [f=1];
100 | 40 -- 47 [f=1];
101 | 43 -- 11 [f=1];
102 | 43 -- 17 [f=19];
103 | }
104 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/graphviz/graphs/undirected/process.gv:
--------------------------------------------------------------------------------
1 | graph G {
2 | run -- intr;
3 | intr -- runbl;
4 | runbl -- run;
5 | run -- kernel;
6 | kernel -- zombie;
7 | kernel -- sleep;
8 | kernel -- runmem;
9 | sleep -- swap;
10 | swap -- runswap;
11 | runswap -- new;
12 | runswap -- runmem;
13 | new -- runmem;
14 | sleep -- runmem;
15 | }
16 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/man/man1/acyclic.1:
--------------------------------------------------------------------------------
1 | .TH ACYCLIC 1 "21 March 2001"
2 | .SH NAME
3 | acyclic \- make directed graph acyclic
4 | .SH SYNOPSIS
5 | .B acyclic
6 | [
7 | .B \-nv?
8 | ] [
9 | .B \-o
10 | .I outfile
11 | ]
12 | [
13 | .I file
14 | ]
15 | .SH DESCRIPTION
16 | .B acyclic
17 | is a filter that takes a directed graph as input and outputs
18 | a copy of the graph with sufficient edges reversed to make
19 | the graph acyclic. The reversed edge inherits all of the attributes
20 | of the original edge. The optional file argument specifies where the
21 | input graph is stored; by default, the program reads from \fBstdin\fP.
22 | .SH OPTIONS
23 | The following options are supported:
24 | .TP
25 | .B \-n
26 | No output is produced, though the return value
27 | will indicate whether the graph is acyclic or not.
28 | .TP
29 | .B \-v
30 | Print information about whether the file is acyclic, has a cycle or
31 | is undirected.
32 | .TP
33 | .BI \-o " outfile"
34 | causes the output to be written to the specified file; by default,
35 | output is written to \fBstdout\fP.
36 | .TP
37 | .B \-?
38 | option causes the program to print usage information.
39 | .SH RETURN CODES
40 | .B acyclic
41 | returns
42 | .B 0
43 | if the graph is acyclic;
44 | .B 1
45 | if the graph has a cycle;
46 | .B 2
47 | if the graph is undirected; and
48 | .B 255
49 | if there are any errors.
50 | .SH BUGS
51 | If the graph is strict and there is a cycle of length 2,
52 | the attributes of the reversed edge are lost.
53 | .PP
54 | Some edge attributes are non-symmetric, referring to either the head
55 | or tail node. At present, there is no mechanism or convention for
56 | correctly switching or renaming these.
57 | .SH AUTHORS
58 | Stephen C. North
59 | .br
60 | Emden R. Gansner
61 | .SH "SEE ALSO"
62 | gc(1), dot(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), tred(1), libgraph(3)
63 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/man/man1/dijkstra.1:
--------------------------------------------------------------------------------
1 | .TH DIJKSTRA 1 "21 March 2001"
2 | .SH NAME
3 | dijkstra \- single-source distance filter for Graphviz
4 | .SH SYNOPSIS
5 | .B dijkstra
6 | [
7 | .B \-adp?
8 | ]
9 | [
10 | .I sourcenode file
11 | ]
12 | .SH DESCRIPTION
13 | .B dijkstra
14 | reads a stream of Graphviz formatted graphs and for each computes the distance of every node from
15 | .I sourcenode.
16 | Edge length is given in the
17 | .I len
18 | attribute, and the default is 1. The
19 | .I dist
20 | attribute of every node is set to its distance from
21 | .I sourcenode.
22 | If the \fB-p\fP flag is used, the
23 | .I prev
24 | attribute of each node reachable from
25 | .I sourcenode
26 | is set to the name of the previous node on a shortest path.
27 | The graph attribute
28 | .I maxdist
29 | is set to the maximum
30 | .I dist
31 | of all nodes in the graph.
32 | .P
33 | If the \fB-d\fP flag is used, the graph is treated as directed and
34 | only forward edges are used.
35 | .P
36 | By default, if the graph is disconnected, the
37 | .I dist
38 | attribute of nodes unreachable from
39 | .I sourcenode
40 | are left untouched, and
41 | .I maxdist
42 | is set to the maximum of any previous value and the largest
43 | distance recorded in this run. On the other hand, if
44 | the \fB-a\fP flag is used, the
45 | .I dist
46 | attribute of an unreachable node is assigned a very large value,
47 | and
48 | .I maxdist
49 | records the maximum distance found in the component containing
50 | .I sourcenode.
51 | .P
52 | Any number of
53 | .I sourcenode file
54 | pairs may be given.
55 | If the last
56 | .I file
57 | is missing, \fBstdin\fP is used.
58 | All output is written to \fBstdout\fP.
59 | .P
60 | In a typical application,
61 | .I dist
62 | and
63 | .I maxdist
64 | can drive a downstream calculation of color or some other attribute.
65 | .SH "SEE ALSO"
66 | gvpr(1), gvcolor(1), libgraph(3)
67 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/man/man1/gc.1:
--------------------------------------------------------------------------------
1 | .TH GC 1 "21 March 2001"
2 | .SH NAME
3 | gc \- count graph components
4 | .SH SYNOPSIS
5 | .B gc
6 | [
7 | .B \-necCaDUrsv?
8 | ]
9 | [
10 | .I files
11 | ]
12 | .SH DESCRIPTION
13 | .B gc
14 | is a graph analogue to
15 | .B wc
16 | in that it prints to standard output
17 | the number of nodes, edges, connected components or clusters contained
18 | in the input files.
19 | It also prints a total count for
20 | all graphs if more than one graph is given.
21 | .SH OPTIONS
22 | The following options are supported:
23 | .TP
24 | .B \-n
25 | Count nodes.
26 | .TP
27 | .B \-e
28 | Count edges.
29 | .TP
30 | .B \-c
31 | Count connected components.
32 | .TP
33 | .B \-C
34 | Count clusters. By definition, a cluster is a graph or
35 | subgraph whose name begins with "cluster".
36 | .TP
37 | .B \-a
38 | Count all. Equivalent to
39 | .B \-encC
40 | .TP
41 | .B \-r
42 | Recursively analyze subgraphs.
43 | .TP
44 | .B \-s
45 | Print no output. Only exit value is important.
46 | .TP
47 | .B \-D
48 | Only analyze directed graphs.
49 | .TP
50 | .B \-U
51 | Only analyze undirected graphs.
52 | .TP
53 | .B \-v
54 | Verbose output.
55 | .TP
56 | .B \-?
57 | Print usage information.
58 | .LP
59 | By default,
60 | .I gc
61 | returns the number of nodes and edges.
62 | .SH OPERANDS
63 | The following operand is supported:
64 | .TP 8
65 | .I files
66 | Names of files containing 1 or more graphs in dot format.
67 | If no
68 | .I files
69 | operand is specified,
70 | the standard input will be used.
71 | .SH "EXIT STATUS"
72 | The following exit values are returned:
73 | .TP 4
74 | .B 0
75 | Successful completion.
76 | .TP
77 | .B 1
78 | The
79 | .B \-U
80 | or
81 | .B \-E
82 | option was used, and a graph of the wrong type was encountered.
83 | .SH AUTHOR
84 | Emden R. Gansner
85 | .SH "SEE ALSO"
86 | wc(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), tred(1), libgraph(3)
87 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/man/man1/gml2gv.1:
--------------------------------------------------------------------------------
1 | .TH GML2GV,GV2GML 1 "24 June 2011"
2 | .SH NAME
3 | gml2gv,gv2gml \- GML-DOT converters
4 | .SH SYNOPSIS
5 | .B gml2gv
6 | [
7 | .B \-?v
8 | ]
9 | [
10 | .BI -g gname
11 | ]
12 | [
13 | .BI -o outfile
14 | ]
15 | [
16 | .I files
17 | ]
18 | .br
19 | .B gv2gml
20 | [
21 | .B \-?
22 | ]
23 | [
24 | .BI -o outfile
25 | ]
26 | [
27 | .I files
28 | ]
29 |
30 | .SH DESCRIPTION
31 | .B gml2gv
32 | converts a graph specified in the GML format to a graph in the GV (formerly DOT) format.
33 | .B gv2gml
34 | converts a graph specified in the GV format to a graph in the GML format.
35 | .SH OPTIONS
36 | The following options are supported:
37 | .TP
38 | .B \-v
39 | Turns on verbose mode
40 | .TP
41 | .B \-?
42 | Prints usage information and exits.
43 | .TP
44 | .BI \-g "gname"
45 | The string \fIgname\fP is used as the name of the generated graph.
46 | If multiple graphs are generated, subsequent graphs use the name
47 | \fIgname\fP appended with an integer.
48 | .TP
49 | .BI \-o "outfile"
50 | Prints output to the file \fIoutfile\fP. If not given, \fBgml2gv\fP
51 | uses stdout.
52 | .TP
53 | .SH OPERANDS
54 | The following operand is supported:
55 | .TP 8
56 | .I files
57 | Names of files containing 1 or more graphs in GML.
58 | If no
59 | .I files
60 | operand is specified,
61 | the standard input will be used.
62 | .SH RETURN CODES
63 | Return \fB0\fP
64 | if there were no problems during conversion;
65 | and non-zero if any error occurred.
66 | .SH "LIMITATIONS"
67 | As both the graph and graphics models of GV and GML differ significantly, the
68 | conversion is at best approximate. In particular, it is not clear how multiedges
69 | are differentiated in GML, so multiedges are created in GV with no user-available
70 | key. Also, no attribute information is lost, in that
71 | any GML attributes that aren't converted to GV equivalents are retained as
72 | attributes in the output graph.
73 | .P
74 | At present,
75 | .B gv2gml
76 | does not support subgraphs and clusters. In addition, there does not appear to be
77 | a standard mechanism for specifying default node and edge attributes in GML, so
78 | any attributes are repeated for every node and edge.
79 | .SH AUTHORS
80 | Emden R. Gansner
81 | .SH "SEE ALSO"
82 | dot(1), libcgraph(3)
83 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/man/man1/graphml2gv.1:
--------------------------------------------------------------------------------
1 | .TH GRAPHML2GV 1 "14 July 2011"
2 | .SH NAME
3 | graphml2gv \- GRAPHML-DOT converter
4 | .SH SYNOPSIS
5 | .B graphml2gv
6 | [
7 | .B \-?v
8 | ]
9 | [
10 | .BI -g gname
11 | ]
12 | [
13 | .BI -o outfile
14 | ]
15 | [
16 | .I files
17 | ]
18 | .SH DESCRIPTION
19 | .B graphml2gv
20 | converts a graph specified in the GRAPHML format to a graph in the GV (formerly DOT) format.
21 | .SH OPTIONS
22 | The following options are supported:
23 | .TP
24 | .B \-v
25 | Turns on verbose mode
26 | .TP
27 | .B \-?
28 | Prints usage information and exits.
29 | .TP
30 | .BI \-g "gname"
31 | The string \fIgname\fP is used as the name of the generated graph.
32 | If multiple graphs are generated, subsequent graphs use the name
33 | \fIgname\fP appended with an integer.
34 | .TP
35 | .BI \-o "outfile"
36 | Prints output to the file \fIoutfile\fP. If not given, \fBgraphml2gv\fP
37 | uses stdout.
38 | .TP
39 | .SH OPERANDS
40 | The following operand is supported:
41 | .TP 8
42 | .I files
43 | Names of files containing 1 or more graphs in GRAPHML.
44 | If no
45 | .I files
46 | operand is specified,
47 | the standard input will be used.
48 | .SH RETURN CODES
49 | Return \fB0\fP
50 | if there were no problems during conversion;
51 | and non-zero if any error occurred.
52 | .SH "LIMITATIONS"
53 | As both the graph and graphics models of GV and GML differ significantly, the
54 | conversion can only be at best approximate.
55 | In particular, GV currently has no notion of hyperedges or edges containing graphs.
56 | .P
57 | At present,
58 | .B graphml2gv
59 | only supports the basic graph topology. Specifically, the and
60 | elements are not handled, though they could be.
61 | .SH AUTHORS
62 | Emden R. Gansner
63 | .SH "SEE ALSO"
64 | dot(1), libcgraph(3)
65 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/man/man1/gvcolor.1:
--------------------------------------------------------------------------------
1 | .TH GVCOLOR 1 "21 March 2001"
2 | .SH NAME
3 | gvcolor \- flow colors through a ranked digraph
4 | .SH SYNOPSIS
5 | .B gvcolor
6 | [
7 | .I files
8 | ]
9 | .SH "USAGE"
10 | .ft 5
11 | dot file.gv | gvcolor | dot \-T\fI\fP
12 | .ft
13 | .SH DESCRIPTION
14 | .B gvcolor
15 | (previously known as
16 | .BR colorize)
17 | is a filter that sets node colors from initial seed values.
18 | Colors flow along edges from tail to head, and are averaged
19 | (as HSB vectors) at nodes.
20 | \fIThe graph must already have been processed by dot.\fP
21 | Appropriate choice of initial colors yields drawings in which node
22 | colors help to emphasize logical relationships between nodes, even
23 | when they are spread far apart in the layout.
24 | .PP
25 | Initial colors must be set externally, using the \fBcolor\fP
26 | attribute of a node. It is often effective to
27 | assign colors to a few key source or sink nodes, manually setting
28 | their colors by editing the graph file.
29 | Color names are as in \fIdot(1)\fP: symbolic names or RGB triples.
30 | It is best to choose some easily\(hydistinguished but related colors;
31 | not necessarily spaced evenly around the color wheel. For example,
32 | blue_green, green, and light_yellow looks better than red, green, blue.
33 | .PP
34 | Certain graph attributes control the \fIgvcolor\fP algorithm.
35 | \fBflow=back\fP reverses the flow of colors from heads to tails.
36 | \fBsaturation=.1,.9\fP (or any two numbers between 0 and 1)
37 | adjusts the color saturation linearly from least to greatest rank.
38 | If \fBDefcolor\fP is set, this color value is applied to any
39 | node not otherwise colored.
40 | .SH "EXIT STATUS"
41 | The following exit values are returned:
42 | .TP 4
43 | .B 0
44 | Successful completion.
45 | .TP
46 | .B 1
47 | If nodes of the graph do not possess a ``pos'' attribute.
48 | .SH BUGS
49 | It would be nice to make the program work without relying on
50 | an initial pass through \fBdot\fP.
51 | .SH AUTHORS
52 | Stephen C. North
53 | .br
54 | Emden R. Gansner
55 | .SH "SEE ALSO"
56 | gc(1), dot(1), gvpr(1), ccomps(1), sccmap(1), tred(1), libgraph(3)
57 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/man/man1/nop.1:
--------------------------------------------------------------------------------
1 | .TH NOP 1 "21 March 2001"
2 | .SH NAME
3 | nop \- pretty-print graph file
4 | .SH SYNOPSIS
5 | .B nop
6 | [
7 | .B \-p?
8 | ]
9 | [
10 | .I files
11 | ]
12 | .SH DESCRIPTION
13 | .B nop
14 | reads a stream of graphs and prints each in pretty-printed (canonical) format
15 | on stdout. If no
16 | .I files
17 | are given, it reads from stdin.
18 | .SH OPTIONS
19 | The following options are supported:
20 | .TP
21 | .B \-p
22 | Produce no output - just check the input for valid DOT.
23 | .TP
24 | .B \-?
25 | Print usage information.
26 | .SH "EXIT STATUS"
27 | If any errors occurred while processing any input, such as a file
28 | not found or a file containing illegal DOT, \fBEXIT_FAILURE\fR is returned.
29 | Otherwise \fBEXIT_SUCCESS\fR is returned.
30 | .SH "SEE ALSO"
31 | wc(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), tred(1), libgraph(3)
32 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/man/man1/sccmap.1:
--------------------------------------------------------------------------------
1 | .TH SCCMAP 1 "21 March 2001"
2 | .SH NAME
3 | sccmap \- extract strongly connected components of directed graphs
4 | .SH SYNOPSIS
5 | \fBsccmap\fR
6 | [\fB\-dsSv\fR]
7 | [
8 | .BI \-o outfile
9 | ]
10 | [
11 | .I files
12 | ]
13 | .SH DESCRIPTION
14 | .I sccmap
15 | decomposes digraphs into strongly connected components
16 | and an auxiliary map of the relationship between components.
17 | In this map, each component is collapsed into a node.
18 | The resulting graphs are printed to standard out.
19 | The number of nodes, edges and strongly connected components
20 | are printed to standard error.
21 | .B sccmap
22 | is a way of partitioning large graphs into more manageable pieces.
23 | .SH OPTIONS
24 | The following options are supported:
25 | .TP
26 | .B \-d
27 | Preserve degenerate components of only one node.
28 | .TP
29 | .B \-s
30 | Do not print the resulting graphs. Only the statistics are
31 | important.
32 | .TP
33 | .B \-S
34 | Just print the resulting graphs. No statistics are printed.
35 | .TP
36 | .BI \-o "output"
37 | Prints output to the file \fIoutput\fP. If not given, \fBsccmap\fP
38 | uses stdout.
39 | .TP
40 | .B \-v
41 | Generate additional statistics. In particular,
42 | .B sccmap
43 | prints the number of nodes, edges, connected components,
44 | and strongly connected components, followed by the fraction of
45 | nodes in a non-trivial strongly connected components,
46 | the maximum degree of the graph, and fraction of non-tree edges
47 | in the graph.
48 | .SH OPERANDS
49 | The following operand is supported:
50 | .TP 8
51 | .I files
52 | Names of files containing 1 or more graphs in dot format.
53 | If no
54 | .I files
55 | operand is specified,
56 | the standard input will be used.
57 | .SH "DIAGNOSTICS"
58 | \fBsccmap\fP emits a warning if it encounters an undirected graph,
59 | and ignores it.
60 | .SH AUTHORS
61 | Stephen C. North
62 | .br
63 | Emden R. Gansner
64 | .SH "SEE ALSO"
65 | gc(1), dot(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), tred(1), libgraph(3)
66 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/man/man1/tred.1:
--------------------------------------------------------------------------------
1 | .TH TRED 1 "21 March 2001"
2 | .SH NAME
3 | tred \- transitive reduction filter for directed graphs
4 | .SH SYNOPSIS
5 | .B tred
6 | [
7 | .B \-vr?
8 | ]
9 | [
10 | .I files
11 | ]
12 | .SH DESCRIPTION
13 | .B tred
14 | computes the transitive reduction of directed graphs,
15 | and prints the resulting graphs to standard output.
16 | This removes edges implied by transitivity.
17 | Nodes and subgraphs are not otherwise affected.
18 | The ``meaning'' and validity of the reduced graphs
19 | is application dependent.
20 | .B tred
21 | is particularly useful as a preprocessor to
22 | .I dot
23 | to reduce clutter in dense layouts.
24 | .PP
25 | Undirected graphs are silently ignored.
26 | .SH OPTIONS
27 | The following options are supported:
28 | .TP
29 | .B \-v
30 | Verbose output to stderr.
31 | .TP
32 | .B \-r
33 | Print information of removed edges to stderr.
34 | .TP
35 | .B \-?
36 | Print usage information.
37 | .SH OPERANDS
38 | The following operand is supported:
39 | .TP 8
40 | .I files
41 | Names of files containing 1 or more graphs in dot format.
42 | If no
43 | .I files
44 | operand is specified,
45 | the standard input will be used.
46 | .SH "BUGS"
47 | Using bitmaps internally would substantially decrease running time.
48 | .SH "DIAGNOSTICS"
49 | If a graph has cycles, its transitive reduction is not uniquely defined.
50 | In this case \fItred\fP emits a warning.
51 | .SH AUTHORS
52 | Stephen C. North
53 | .br
54 | Emden R. Gansner
55 | .SH "SEE ALSO"
56 | gc(1), dot(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), libgraph(3)
57 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/man/man1/unflatten.1:
--------------------------------------------------------------------------------
1 | .TH UNFLATTEN 1 "21 January 2001"
2 | .SH NAME
3 | unflatten \- adjust directed graphs to improve layout aspect ratio
4 | .SH SYNOPSIS
5 | .B unflatten
6 | [\fB\-f?\fR]
7 | [\fB\-l\fIlen\fR]
8 | [\fB\-c\fIlen\fR
9 | ] [
10 | .B \-o
11 | .I outfile
12 | ]
13 | [ files ]
14 | .SH DESCRIPTION
15 | .B unflatten
16 | is a preprocessor to
17 | .B dot
18 | that is
19 | used to improve the aspect ratio of graphs having many leaves
20 | or disconnected nodes.
21 | The usual layout for such a graph is generally very wide or tall.
22 | .B unflatten
23 | inserts invisible edges or adjusts the \fBminlen\fP on edges
24 | to improve layout compaction.
25 | .SH OPTIONS
26 | The following options are supported:
27 | .TP
28 | .BI \-l " len"
29 | The minimum length of leaf edges is staggered
30 | between 1 and \fIlen\fP (a small integer).
31 | .TP
32 | .B \-f
33 | Enables the staggering of the \fB-l\fP option to fanout nodes whose
34 | indegree and outdegree are both 1. This helps with structures such
35 | as \fIa -> {w x y z} -> b\fP.
36 | This option only works if the \fB-l\fP flag is set.
37 | .TP
38 | .BI \-c " len"
39 | Form disconnected nodes into chains of up to \fIlen\fP nodes.
40 | .TP
41 | .BI \-o " outfile"
42 | causes the output to be written to the specified file; by default,
43 | output is written to \fBstdout\fP.
44 | .TP
45 | .BI \-?
46 | Prints the usage and exits.
47 | .SH OPERANDS
48 | The following operand is supported:
49 | .TP 8
50 | .I files
51 | Names of files containing 1 or more graphs in dot format.
52 | If no
53 | .I files
54 | operand is specified,
55 | the standard input will be used.
56 | .SH AUTHORS
57 | Stephen C. North
58 | .br
59 | Emden R. Gansner
60 | .SH "SEE ALSO"
61 | gc(1), dot(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), tred(1), libgraph(3)
62 |
--------------------------------------------------------------------------------
/westat/plugins/win/Graphviz/share/man/man3/gvc.3:
--------------------------------------------------------------------------------
1 | .TH LIBGVC 3
2 | .SH NAME
3 | \fBlibgvc\fR \- Graphviz context library
4 | .SH SYNOPSIS
5 | .ta .75i 1.5i 2.25i 3i 3.75i 4.5i 5.25i 6i
6 | .PP
7 | .nf
8 | \f5
9 | #include
10 |
11 | /* set up a graphviz context */
12 | extern GVC_t *gvNEWcontext(char **info, char *user);
13 | extern char *gvUsername(void);
14 |
15 | /* set up a graphviz context \(hy alternative */
16 | /* (wraps the above two functions using info built into libgvc) */
17 | extern GVC_t *gvContext(void);
18 |
19 | /* parse command line args \(hy minimally argv[0] sets layout engine */
20 | extern int gvParseArgs(GVC_t *gvc, int argc, char **argv);
21 | extern graph_t *gvNextInputGraph(GVC_t *gvc);
22 |
23 | /* Compute a layout using a specified engine */
24 | extern int gvLayout(GVC_t *gvc, graph_t *g, char *engine);
25 |
26 | /* Compute a layout using layout engine from command line args */
27 | extern int gvLayoutJobs(GVC_t *gvc, graph_t *g);
28 |
29 | /* Render layout into string attributes of the graph */
30 | extern void attach_attrs(graph_t *g);
31 |
32 | /* Parse an html string */
33 | extern char *agstrdup_html(char *s);
34 | extern int aghtmlstr(char *s);
35 |
36 | /* Render layout in a specified format to an open FILE */
37 | extern int gvRender(GVC_t *gvc, graph_t *g, char *format, FILE *out);
38 |
39 | /* Render layout in a specified format to an open FILE */
40 | extern int gvRenderFilename(GVC_t *gvc, graph_t *g, char *format, char *filename);
41 |
42 | /* Render layout according to \-T and \-o options found by gvParseArgs */
43 | extern int gvRenderJobs(GVC_t *gvc, graph_t *g);
44 |
45 | /* Clean up layout data structures \(hy layouts are not nestable (yet) */
46 | extern int gvFreeLayout(GVC_t *gvc, graph_t *g);
47 |
48 | /* Clean up graphviz context */
49 | extern int gvFreeContext(GVC_t *gvc);
50 |
51 | /* Inquire about available plugins */
52 | /* See comment in gvc.h */
53 | extern char** gvPluginList(GVC_t *gvc, char* kind, int* cnt, char*);
54 |
55 | \fP
56 | .fi
57 | .SH DESCRIPTION
58 | \fIlibgvc\fP provides a context for applications wishing to manipulate
59 | and render graphs. It provides a command line parsing, common rendering code,
60 | and a plugin mechanism for renderers.
61 |
62 | .SH SEE ALSO
63 | .BR dot (1),
64 | .BR neato (1),
65 | .BR libcdt (3)
66 | .BR libgraph (3)
67 | .br
68 |
69 | .SH AUTHOR
70 | John Ellson (ellson@research.att.com), AT&T
71 |
--------------------------------------------------------------------------------
/westat/quant/__init__.py:
--------------------------------------------------------------------------------
1 | from .get_stock import get_stock
2 | from .get_stock_pk import get_stock_pk
3 | from .get_stock_m import get_stock_m
4 | from .get_stock_i import get_stock_i
5 | from .get_stock_index import get_stock_index
6 |
--------------------------------------------------------------------------------
/westat/quant/get_stock_m.py:
--------------------------------------------------------------------------------
1 | def get_stock_m(code='sh000001', language='cn'):
2 | """
3 | 根据证券代码获取股票分钟数据
4 | Returns:
5 | 指定股票的分钟数据
6 | """
7 | import requests
8 | import pandas as pd
9 | from westat.utils import regexp_like
10 |
11 | if len(code) == 6 and regexp_like(code[:3], '600|601|603|605|900'):
12 | code = 'sh' + code
13 | elif len(code) == 6 and regexp_like(code[:3], '000|002|003|200|300'):
14 | code = 'sz' + code
15 | elif len(code) == 5:
16 | code = 'hk' + code
17 | elif not regexp_like(code[:2],'sh|sz|hk') and regexp_like(code.lower(),'[a-z].+') and not regexp_like(code.lower(),'us'):
18 | code = 'us' + code.replace('.','')
19 | else:
20 | code = code
21 |
22 | response = requests.get('https://web.ifzq.gtimg.cn/appstock/app/minute/query?code=' + code)
23 |
24 | if response.status_code == 200:
25 | text = response.json()
26 | if response.json()['msg'] == 'code param error':
27 | print('未匹配到任何数据！')
28 | else:
29 | data = text['data'][code]['data']['data']
30 |
31 | data_list = []
32 | for d in data:
33 | row = d.split(' ')
34 | minute = row[0]
35 | price = row[1]
36 | vol = row[2]
37 | amount = row[3]
38 | data_list.append([minute, price, vol, amount])
39 | result = pd.DataFrame(data_list, columns=['time', 'price', 'volume', 'amount'])
40 | result['time'] = pd.to_numeric(result['time'])
41 | result['price'] = pd.to_numeric(result['price'])
42 | result['volume'] = pd.to_numeric(result['volume'])
43 | result['amount'] = pd.to_numeric(result['amount'])
44 |
45 | if language == 'cn':
46 | result.rename(columns={'time': '时间', 'price': '价格', 'volume': '成交量', 'amount': '成交额'},inplace=True)
47 | return result
48 |
--------------------------------------------------------------------------------
/westat/quant/get_stock_pk.py:
--------------------------------------------------------------------------------
1 | def get_stock_pk(code='sh000001', language='cn'):
2 | """
3 | 根据证券代码获取股票盘口数据
4 | Returns:
5 | 指定股票的盘口数据
6 | """
7 | import requests
8 | import pandas as pd
9 | from westat.utils import regexp_like
10 |
11 | if len(code) == 6 and regexp_like(code[:3], '600|601|603|605|900'):
12 | code = 'sh' + code
13 | elif len(code) == 6 and regexp_like(code[:3], '000|002|003|200|300'):
14 | code = 'sz' + code
15 | elif len(code) == 5:
16 | code = 'hk' + code
17 | elif not regexp_like(code[:2],'sh|sz|hk') and regexp_like(code.lower(),'[a-z].+') and not regexp_like(code.lower(),'us'):
18 | code = 'us' + code.replace('.','')
19 | else:
20 | code = code
21 |
22 | response = requests.get('http://qt.gtimg.cn/q=s_pk' + code)
23 |
24 | if response.status_code == 200:
25 | text = response.text
26 |
27 | if regexp_like(text, 'none_match'):
28 | print('未匹配到任何数据！')
29 | else:
30 |
31 | data = text.split('"')[1].split('~')
32 | result = pd.DataFrame(data, index=range(len(data))).T
33 | result.columns = ['buy_big', 'buy_small', 'sale_big', 'sale_small']
34 | result['time'] = pd.to_numeric(result['time'])
35 |
36 | if language == 'cn':
37 | result.rename(columns={'buy_big': '买盘大单', 'buy_small': '买盘小单', 'sale_big': '卖盘大单',
38 | 'sale_small': '卖盘小单'})
39 |
40 | return result
41 |
--------------------------------------------------------------------------------
/westat/sample/__init__.py:
--------------------------------------------------------------------------------
1 | from pandas import read_csv, read_excel
2 |
3 | from .get_data_partition import get_data_partition
4 |
--------------------------------------------------------------------------------
/westat/sample/get_data_partition.py:
--------------------------------------------------------------------------------
1 | import numpy as np
2 | import pandas as pd
3 | from sklearn.model_selection import train_test_split
4 |
5 |
6 | def get_data_partition(data: pd.DataFrame,
7 | test_size: float = 0.25,
8 | random_state=1234,
9 | target: str = 'y'):
10 | """
11 | 划分训练集和测试集
12 | Args:
13 | data: DataFrame,将要进行数据分区的目标数据集
14 | target: str,目标变量名称，默认为'y'
15 | test_size:float 测试集所占比例，默认为0.25
16 | random_state: 随机种子，默认为1234
17 |
18 | Returns:
19 | 返回数据分区后的训练集和测试集
20 | """
21 | X = data[[col for col in data.columns if col != target]]
22 | y = data[target]
23 | x_train, x_test, y_train, y_test = train_test_split(X, y, test_size=test_size, random_state=random_state)
24 | data_train = x_train.reset_index()
25 | del data_train['index']
26 | data_train[target] = y_train.reset_index()[target]
27 | data_test = x_test.reset_index()
28 | del data_test['index']
29 | data_test[target] = y_test.reset_index()[target]
30 | return data_train, data_test
31 |
--------------------------------------------------------------------------------
/westat/utils/__init__.py:
--------------------------------------------------------------------------------
1 | from .path import current_path
2 | from .device import user_name, host_name, host_ip
3 | from .datetime import date_diff,add_months,year_start,year_end,month_start,month_end,month_diff
4 | from .math import sin, cos
5 | from .get_max_continue import get_max_continue
6 | from .get_over_continue import get_over_continue
7 | from .nvl import nvl
8 | from .growth_rate import growth_rate
9 | from .rate import rate
10 | from .regexp_replace import regexp_replace
11 | from .regexp_like import regexp_like
12 | from .to_single_byte import to_single_byte
13 | from .to_multi_byte import to_multi_byte
14 | from .set_precision import set_precision
--------------------------------------------------------------------------------
/westat/utils/device.py:
--------------------------------------------------------------------------------
1 | import socket
2 | import getpass
3 |
4 | # 设备信息
5 | user_name = getpass.getuser() # 获取当前用户名
6 | host_name = socket.gethostname() # 获取当前主机名
7 | host_ip = socket.gethostbyname(socket.gethostname()) # 获取当前IP
8 |
--------------------------------------------------------------------------------
/westat/utils/export/to_csv.py:
--------------------------------------------------------------------------------
1 | def to_csv(data,path,index=True):
2 | data.to_csv(path=,index=index)
--------------------------------------------------------------------------------
/westat/utils/get_max_continue.py:
--------------------------------------------------------------------------------
1 | import pandas as pd
2 |
3 |
4 | def get_max_continue(column, find=0):
5 | """
6 | 根据已经排序好的序列s，计算find出现的最大连续次数
7 | Args:
8 | column:pd.Series，已经排序的数据序列
9 | find:int，需要查找的值，默认为0
10 | Returns:
11 | int,find最大连续出现的次数
12 | """
13 | if isinstance(column,list) or isinstance(column,tuple):
14 | column=pd.Series(column)
15 | x = 0
16 | y = []
17 |
18 | for i in column:
19 | if i != find:
20 | x = 0
21 | y.append(x)
22 | else:
23 | x = x + 1
24 | y.append(x)
25 | return max(y)
--------------------------------------------------------------------------------
/westat/utils/get_over_continue.py:
--------------------------------------------------------------------------------
1 | import pandas as pd
2 |
3 |
4 | def get_over_continue(column, over=0, eq=False):
5 | """
6 | 获取序列连续大于指定值的次数 ，或序列连续相等且大于指定值的次数
7 | Args:
8 | column: pd.Series，已经排序的数据序列
9 | over: int，需要大于的指定值，默认为0
10 | eq: 是否要求取值相等
11 |
12 | Returns:
13 | int, 序列连续大于指定值的次数 ，或序列连续相等且大于指定值的次数
14 | """
15 | if isinstance(column, list) or isinstance(column, tuple):
16 | column = pd.Series(column)
17 |
18 | x = 0
19 | y = []
20 |
21 | # 循环检查序列中的每个元素，是否大于指定值，并与上一个元素相等
22 | for i in range(len(column)):
23 | # print(i,' ',column[i],' ',y)
24 | if i == 0:
25 | if column[i] > over:
26 | x = x + 1
27 | y.append(x)
28 | else:
29 | x = 0
30 | y.append(x)
31 | else:
32 | if column[i] > over:
33 | if eq:
34 | if column[i] == column[i - 1]: # 如果当前元素与上一个元素相等，则统计数+1
35 | x = x + 1
36 | y.append(x)
37 | else:
38 | x = 1 # 如果当前元素与上一个元素不相等，则初始化为1
39 | y.append(x)
40 | else:
41 | x = x + 1
42 | y.append(x)
43 | else:
44 | x = 0
45 | y.append(x)
46 | return max(y)
47 |
--------------------------------------------------------------------------------
/westat/utils/growth_rate.py:
--------------------------------------------------------------------------------
1 | import numpy as np
2 |
3 |
4 | def growth_rate(a: float, b: float, method: int = 1, missing=99999999) -> float:
5 | """
6 | 计算两个数值的增长率 (a-b)/b
7 | Args:
8 | a: 本期数值
9 | b: 上期数值
10 | method:增长率计算方法，
11 | 1：分子或分母缺失时，赋值为null；分母为0时，结果为null；
12 | 2：分子或分母缺失时，赋值为null；分母为0时，根据分子>0、=0、<0，分别赋值为 missing、0、-missing
13 | Returns:
14 | 增长率计算结果
15 | """
16 | if method == 1:
17 | if b == 0:
18 | result = np.nan
19 | else:
20 | result = (a - b) / b
21 | elif method == 2:
22 | if b == 0:
23 | if a > 0:
24 | result = missing
25 | elif a == 0:
26 | result = 0
27 | elif a < 0:
28 | result = -missing
29 | else:
30 | result = (a - b) / b
31 |
32 | return result
33 |
--------------------------------------------------------------------------------
/westat/utils/math.py:
--------------------------------------------------------------------------------
1 | import math
2 |
3 |
4 | def cos(number, precision=4):
5 | """
6 | 返回cos函数结果
7 | Args:
8 | number:
9 | precision:
10 |
11 | Returns:
12 |
13 | """
14 | result = round(math.cos(number), precision)
15 | return result
16 |
17 |
18 | def sin(number, precision=4):
19 | """
20 | 返回cos函数结果
21 | Args:
22 | number:
23 | precision:
24 |
25 | Returns:
26 |
27 | """
28 | result = round(math.sin(number), precision)
29 | return result
30 |
--------------------------------------------------------------------------------
/westat/utils/nvl.py:
--------------------------------------------------------------------------------
1 | import pandas as pd
2 |
3 |
4 | def nvl(value, new_value):
5 | """
6 | 如果变量为空则返回新取值，否则返回旧的值
7 | Args:
8 | value: 需要判断是否为空的变量
9 | new_value: 当变量为空时的取值
10 |
11 | Returns:
12 | 如果变量为空则返回新的取值，否则返回旧的值
13 | """
14 | if value is None or pd.isna(value):
15 | return new_value
16 | else:
17 | return value
18 |
--------------------------------------------------------------------------------
/westat/utils/path.py:
--------------------------------------------------------------------------------
1 | import os
2 |
3 | # 路径
4 | current_path = os.path.dirname(os.path.dirname(os.path.abspath(__file__))) # 获取当前路径
5 |
--------------------------------------------------------------------------------
/westat/utils/rate.py:
--------------------------------------------------------------------------------
1 | import numpy as np
2 | def rate(a: float, b: float, method: int = 1,missing=99999999) -> float:
3 | """
4 | 计算两个数值的比率 a/b
5 | Args:
6 | a: 本期数值
7 | b: 上期数值
8 | method:比率计算方法，
9 | 1：分子或分母缺失时，赋值为null；分母为0时，结果为null；
10 | 2：分子或分母缺失时，赋值为null；分母为0时，根据分子>0、=0、<0，分别赋值为 missing、0、-missing
11 | Returns:
12 | 增长率计算结果
13 | """
14 | if method == 1:
15 | if b == 0:
16 | result = np.nan
17 | else:
18 | result = a / b
19 | elif method == 2:
20 | if b == 0:
21 | if a > 0:
22 | result = missing
23 | elif a == 0:
24 | result = 0
25 | elif a < 0:
26 | result = -missing
27 | else:
28 | result = a / b
29 |
30 | return result
--------------------------------------------------------------------------------
/westat/utils/regexp_like.py:
--------------------------------------------------------------------------------
1 | def regexp_like(source, pattern):
2 | """
3 | 根据输入的字符串，根据正则公式，检查是否匹配指定内容
4 | Args:
5 | source:要替换的原始字符串
6 | pattern:要匹配的正则模式
7 | Returns:
8 |
9 | """
10 | import re
11 | p = re.compile(pattern)
12 | re_result = p.findall(source)
13 | result = len(re_result) > 0
14 | return result
15 |
--------------------------------------------------------------------------------
/westat/utils/regexp_replace.py:
--------------------------------------------------------------------------------
1 | def regexp_replace(source, pattern, replace_string):
2 | """
3 | 根据输入的字符串，根据正则公式，查找指定内容，并进行替换
4 | Args:
5 | source:要替换的原始字符串
6 | pattern:要匹配的正则模式
7 | replace_string:将匹配的pattern替换成的字符串
8 |
9 | Returns:
10 | 返回正则替换后的字符串
11 | """
12 | import re
13 | p = re.compile(pattern)
14 | output_str = p.sub(replace_string, source)
15 | return output_str
16 |
--------------------------------------------------------------------------------
/westat/utils/set_precision.py:
--------------------------------------------------------------------------------
1 | def set_precision(precision=2):
2 | """
3 | 设置pandas数据显示精度
4 | Args:
5 | precision: int,需要显示的小数位数，默认不显示科学计数法，显示2位小数
6 |
7 | Returns:
8 | 没有返回值
9 | """
10 | import pandas as pd
11 | fmt_str = '{:.' + str(precision) + 'f}'
12 | pd.set_option('display.float_format', fmt_str.format)
13 |
--------------------------------------------------------------------------------
/westat/utils/to_multi_byte.py:
--------------------------------------------------------------------------------
1 | def to_multi_byte(input_str):
2 | """
3 | 将输入的字符串中的半角字符转换为全角字符
4 | Args:
5 | input_str: 需要转换的字符串
6 |
7 | Returns:
8 | 转换为全角字符后的字符串
9 | """
10 | output_str = ''
11 | for i in input_str:
12 | code_i = ord(i)
13 | if code_i == 32:
14 | code_i = 12288
15 | elif 33 <= code_i <= 126:
16 | code_i += 65248
17 |
18 | output_str += chr(code_i)
19 |
20 | return output_str
--------------------------------------------------------------------------------
/westat/utils/to_single_byte.py:
--------------------------------------------------------------------------------
1 | def to_single_byte(input_str):
2 | """
3 | 将输入的字符串中的全角字符转换为半角字符
4 | Args:
5 | input_str: 需要转换的字符串
6 |
7 | Returns:
8 | 转换为半角字符后的字符串
9 | """
10 | output_str = ''
11 | for i in input_str:
12 | code_i = ord(i)
13 | if code_i == 12288:
14 | code_i = 32
15 | elif 65281 <= code_i <= 65374:
16 | code_i -= 65248
17 |
18 | output_str += chr(code_i)
19 |
20 | return output_str
21 |
--------------------------------------------------------------------------------