+++ /dev/null
-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;
-}
+++ /dev/null
-/*
- * The transitive 6-net, also known as Heawood's graph,
- * can be used to test the "stability points" of the layout
- * algorithm.
-
- * The "ideal" layout occurs when len="2.5". The layout
- * loses the regularity when smaller values are used.
- */
-graph "Heawood" {
- node [
- fontname = "Arial"
- label = "\N"
- shape = "circle"
- width = "0.50000"
- height = "0.500000"
- color = "black"
- ]
- edge [
- color = "black"
- ]
- /* The outer wheel */
- "0" -- "1" -- "2" -- "3" -- "4" -- "5" -- "6" -- "7" -- "8" -- "9" -- "10" -- "11" -- "12" -- "13" -- "0";
- /* The internal edges. The len = makes them internal */
- "0" -- "5" [len = 2.5];
- "2" -- "7" [len = 2.5];
- "4" -- "9" [len = 2.5];
- "6" -- "11" [len = 2.5];
- "8" -- "13" [len = 2.5];
- "10" -- "1" [len = 2.5];
- "12" -- "3" [len = 2.5];
-}
+++ /dev/null
-/*
- * The transitive 5-net, also known as Petersen's graph,
- * can be used to test the "stability points" of the layout
- * algorithm.
- *
- * The "ideal" layout is achieved for certain random seed
- * values when len=1.5. For len=2.5 or above, the layout
- * is stable. Sometimes, the graph is rendered "inside-out".
- */
-graph "Petersen" {
- node [
- fontname = "Arial"
- label = "\N"
- shape = "circle"
- width = "0.400000"
- height = "0.400000"
- color = "black"
- ]
- edge [
- color = "black"
- ]
- /* Outer wheel. The len= is what makes it outer */
- "0" -- "1" -- "2" -- "3" -- "4" -- "0" [
- color = "blue"
- len = 2.6
- ]
- "0" -- "5" [
- color = "red"
- weight = "5"
- ]
- "1" -- "6" [
- color = "red"
- weight = "5"
- ]
- "2" -- "7" [
- color = "red"
- weight = "5"
- ]
- "3" -- "8" [
- color = "red"
- weight = "5"
- ]
- "4" -- "9" [
- color = "red"
- weight = "5"
- ]
- "5" -- "7" -- "9" -- "6" -- "8" -- "5";
-}
+++ /dev/null
-graph G {
- graph [splines=true overlap=false]
- 1 -- 30 [f=1];
- 1 -- 40 [f=14];
- 8 -- 46 [f=1];
- 8 -- 16 [f=18];
- 10 -- 25 [f=1];
- 10 -- 19 [f=5];
- 10 -- 33 [f=1];
- 12 -- 8 [f=1];
- 12 -- 36 [f=5];
- 12 -- 17 [f=16];
- 13 -- 38 [f=1];
- 13 -- 24 [f=19];
- 24 -- 49 [f=1];
- 24 -- 13 [f=1];
- 24 -- 47 [f=12];
- 24 -- 12 [f=19];
- 25 -- 27 [f=1];
- 25 -- 12 [f=1];
- 27 -- 12 [f=1];
- 27 -- 14 [f=8];
- 29 -- 10 [f=1];
- 29 -- 8 [f=17];
- 30 -- 24 [f=1];
- 30 -- 44 [f=15];
- 38 -- 29 [f=1];
- 38 -- 35 [f=15];
- 2 -- 42 [f=2];
- 2 -- 35 [f=3];
- 2 -- 11 [f=19];
- 14 -- 18 [f=2];
- 14 -- 24 [f=15];
- 14 -- 38 [f=18];
- 18 -- 49 [f=2];
- 18 -- 47 [f=20];
- 26 -- 41 [f=2];
- 26 -- 42 [f=15];
- 31 -- 39 [f=2];
- 31 -- 47 [f=17];
- 31 -- 25 [f=14];
- 37 -- 26 [f=2];
- 37 -- 16 [f=14];
- 39 -- 50 [f=2];
- 39 -- 14 [f=2];
- 39 -- 18 [f=17];
- 39 -- 47 [f=10];
- 41 -- 31 [f=2];
- 41 -- 8 [f=16];
- 42 -- 44 [f=2];
- 42 -- 29 [f=12];
- 44 -- 37 [f=2];
- 44 -- 32 [f=15];
- 3 -- 20 [f=2];
- 3 -- 28 [f=19];
- 6 -- 45 [f=2];
- 6 -- 28 [f=10];
- 9 -- 6 [f=2];
- 9 -- 16 [f=1];
- 15 -- 16 [f=2];
- 15 -- 48 [f=2];
- 16 -- 50 [f=2];
- 16 -- 32 [f=14];
- 16 -- 39 [f=8];
- 20 -- 33 [f=2];
- 33 -- 9 [f=2];
- 33 -- 46 [f=3];
- 33 -- 48 [f=17];
- 45 -- 15 [f=2];
- 4 -- 17 [f=4];
- 4 -- 15 [f=6];
- 4 -- 12 [f=16];
- 17 -- 21 [f=4];
- 19 -- 35 [f=4];
- 19 -- 15 [f=9];
- 19 -- 43 [f=4];
- 21 -- 19 [f=4];
- 21 -- 50 [f=4];
- 23 -- 36 [f=4];
- 34 -- 23 [f=4];
- 34 -- 24 [f=11];
- 35 -- 34 [f=4];
- 35 -- 16 [f=6];
- 35 -- 18 [f=16];
- 36 -- 46 [f=4];
- 5 -- 7 [f=1];
- 5 -- 36 [f=6];
- 7 -- 32 [f=1];
- 7 -- 11 [f=2];
- 7 -- 14 [f=17];
- 11 -- 40 [f=1];
- 11 -- 50 [f=1];
- 22 -- 46 [f=1];
- 28 -- 43 [f=1];
- 28 -- 8 [f=18];
- 32 -- 28 [f=1];
- 32 -- 39 [f=13];
- 32 -- 42 [f=15];
- 40 -- 22 [f=1];
- 40 -- 47 [f=1];
- 43 -- 11 [f=1];
- 43 -- 17 [f=19];
-}
+++ /dev/null
-graph G {
- run -- intr;
- intr -- runbl;
- runbl -- run;
- run -- kernel;
- kernel -- zombie;
- kernel -- sleep;
- kernel -- runmem;
- sleep -- swap;
- swap -- runswap;
- runswap -- new;
- runswap -- runmem;
- new -- runmem;
- sleep -- runmem;
-}