| 95 |
|
} |
| 96 |
|
System.out.println(set); |
| 97 |
|
|
| 98 |
< |
// TEST of getSuccessorCount, getPredecessorCount, getNeighborCount |
| 99 |
< |
System.out.println("TEST degree methods: getNeighborCount, getSuccessorCount, getPredecessorCount"); |
| 98 |
> |
// TEST of degree methods and getSuccessorCount, getPredecessorCount, getNeighborCount |
| 99 |
> |
// degree and neighbor counts are different when the graph has parallel edges (our graphs shouldn't have them anyway) |
| 100 |
> |
System.out.println("TEST degree and neighbor count methods"); |
| 101 |
|
// graph is undirected, graph2 is directed |
| 102 |
|
System.out.println("undirected graph: "); |
| 103 |
|
for (int serial=1;serial<=10;serial++){ |
| 104 |
|
RIGNode node = graph.getNodeFromSerial(serial); |
| 105 |
< |
System.out.println("degree for node "+serial+": "+graph.getNeighborCount(node)+", indegree: "+graph.getPredecessorCount(node)+", outdegree: "+graph.getSuccessorCount(node)); |
| 105 |
> |
System.out.println("node "+serial+": nbr count "+graph.getNeighborCount(node)+", predec count: "+graph.getPredecessorCount(node)+", successor count: "+graph.getSuccessorCount(node)); |
| 106 |
> |
System.out.println("node "+serial+": degree "+graph.degree(node)+", in degree: "+graph.inDegree(node)+", out degree: "+graph.outDegree(node)); |
| 107 |
|
} |
| 108 |
|
System.out.println("directed graph: "); |
| 109 |
|
for (int serial=1;serial<=10;serial++){ |
| 110 |
|
RIGNode node = graph2.getNodeFromSerial(serial); |
| 111 |
< |
System.out.println("degree for node "+serial+": "+graph2.getNeighborCount(node)+", indegree: "+graph2.getPredecessorCount(node)+", outdegree: "+graph2.getSuccessorCount(node)); |
| 111 |
> |
System.out.println("node "+serial+": nbr count "+graph2.getNeighborCount(node)+", predec count: "+graph2.getPredecessorCount(node)+", successor count: "+graph2.getSuccessorCount(node)); |
| 112 |
> |
System.out.println("node "+serial+": degree "+graph2.degree(node)+", in degree: "+graph2.inDegree(node)+", out degree: "+graph2.outDegree(node)); |
| 113 |
|
} |
| 114 |
|
|
| 115 |
|
// TEST adding and getting directed/undirected edges |
