Digraph.java with dfs bipartite detection output

17 has no neighbor points

7 has no neighbor points

8 has no neighbor points

strict digraph {

0[color=red];

1[color=blue];

2[color=red];

3[color=blue];

4[color=red];

5[color=blue];

6[color=red];

7[color=blue];

8[color=blue];

15[color=blue];

16[color=red];

17[color=blue];

19[color=red];

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;

}

number of points: 13

number of edges: 17

is bipartite:false