Graph.java with dfs path visual (with Dot language)

code from http://viz-js.com/, dot language syntax

Java output:

strict graph {

0--1;

0--2;

1--0;

1--2;

1--3;

2--0;

2--1;

2--3;

2--4;

3--1;

3--2;

3--4;

3--5;

4--2;

4--3;

4--5;

4--6;

5--3;

5--4;

5--6;

5--7;

6--4;

6--5;

6--7;

6--8;

7--5;

7--6;

8--6;

15--16;

16--17;

16--15;

17--16;

19--19;

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

1--0[label=1, color=red,penwidth=3.0];

0--2[label=2, color=red,penwidth=3.0];

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

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

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

}

number of points: 13

number of edges: 16

can we reach point 6 from 3? true

can we reach point 16 from 3? false

can we reach point 19 from 3? false