removed unused graphs

This commit is contained in:
Carlos Galindo 2019-12-03 14:13:37 +00:00
parent ee58837daf
commit cbc3a18741
6 changed files with 0 additions and 62 deletions

View file

@ -1,5 +0,0 @@
digraph g {
s [shape=box,label=<Start<br/>x = x_in<br/>y = y_in>];
End [shape=box,label=<x_out = x<br/>End>];
s -> "while (x > y)" -> "x = x - 1" -> "while (x > y)" -> "print(x)" -> End;
}

Binary file not shown.

View file

@ -1,30 +0,0 @@
digraph g {
Start [shape=box];
l2 [label="a = 10"];
l3 [label="b = 20"];
l4 [label="f(a, b)"];
p1 [label="x_in = a"];
p2 [label="y_in = b"];
p3 [label="a = x_out"];
l5 [label="print(a)"];
// Rank
{ rank = same; l2; l3; l4; l5; }
{ rank = min; Start; }
{ rank = same; p1; p2; p3; }
// Control
{ edge [style = bold];
Start -> { l2 l3 l4 l5 };
l4 -> { p1 p2 p3 };
}
// Data
{ edge [color = red];
l2 -> p1;
l3 -> p2;
p3 -> l5;
}
// Order
{ edge [style = invis];
l2 -> l3 -> l4 -> l5;
p1 -> p2 -> p3;
}
}

Binary file not shown.

View file

@ -1,27 +0,0 @@
digraph g {
Start [shape=box];
s1 [label="x = x_in"];
s0 [label="y = y_in"];
s2 [label="while (x > y)"];
s3 [label="x = x + 1"];
s4 [label="print(x)"];
s5 [label="x_out = x"];
// Rank
{ rank=same; s0; s1; s5; }
{ rank=same; s2; s4; }
{ rank=min; Start; }
s0 -> s2 [style=invis];
// Control
{
edge [style = bold];
Start -> {s0 s1 s2 s4 s5};
s2 -> s3;
}
// Data
{
edge [color = red];
edge [constraint = false];
{s1 s3} -> {s2 s3 s4 s5};
s0 -> s2;
}
}

Binary file not shown.