Digraph.java with dfs traversal output

strict digraph {

16->17;

0->1;

0->2;

1->2;

1->3;

2->3;

2->4;

19->19;

3->4;

3->5;

4->5;

4->6;

5->6;

5->7;

6->7;

6->8;

15->16;

3->4[label=0, color=red,penwidth=3.0];

4->5[label=1, color=red,penwidth=3.0];

5->6[label=2, color=red,penwidth=3.0];

6->7[label=3, color=blue,penwidth=3.0];

6->8[label=4, color=blue,penwidth=3.0];

}

number of points: 13

number of edges: 17