Site Search:

output of EwDigraph.java




strict digraph {
0->2[label="0.29",weight="0.29"]
0->1[label="0.80",weight="0.80"]
1->3[label="0.29",weight="0.29"]
1->2[label="0.15",weight="0.15"]
2->3[label="0.78",weight="0.78"]
2->4[label="0.23",weight="0.23"]
3->4[label="0.55",weight="0.55"]
3->5[label="0.80",weight="0.80"]
}

number of points: 6
number of edges: 8
longest edge: 0.80 

========reverse digraph========
strict digraph {
1->0[label="0.80",weight="0.80"]
2->0[label="0.29",weight="0.29"]
2->1[label="0.15",weight="0.15"]
3->1[label="0.29",weight="0.29"]
3->2[label="0.78",weight="0.78"]
4->2[label="0.23",weight="0.23"]
4->3[label="0.55",weight="0.55"]
5->3[label="0.80",weight="0.80"]
}

number of points: 6
number of edges: 8
longest edge: 0.80