Site Search:

Digraph.java with dfs connected components visual (with Dot language)



%3 16 16 17 17 16->17 15 0 0 1 1 0->1 0 2 2 0->2 0 1->2 0 3 3 1->3 0 2->3 0 4 4 2->4 0 3->4 0 5 5 3->5 0 4->5 0 6 6 4->6 0 19 19 19->19 19 5->6 0 7 7 5->7 0 6->7 0 8 8 6->8 0 7->1 0 7->5 0 15 15 15->16 15


Java output:




strict digraph {
16->17[label=15, color=green];
0->1[label=0, color=red];
0->2[label=0, color=red];
1->2[label=0, color=red];
1->3[label=0, color=red];
2->3[label=0, color=red];
2->4[label=0, color=red];
19->19[label=19, color=azure];
3->4[label=0, color=red];
3->5[label=0, color=red];
4->5[label=0, color=red];
4->6[label=0, color=red];
5->6[label=0, color=red];
5->7[label=0, color=red];
6->7[label=0, color=red];
6->8[label=0, color=red];
7->1[label=0, color=red];
7->5[label=0, color=red];
15->16[label=15, color=green];
}
number of points: 13
number of edges: 19

connected components:3

No comments:

Post a Comment