public int testTriangleCount() {
start = System.currentTimeMillis();
int count = 0;
for (Node n0 : g) {
int d = n0.getDegree();
for (int i = 0; i < d; i++) {
Node n1 = n0.getEdge(i).getOpposite(n0);
String n1id = n1.getId();
for (int j = i + 1; j < d; j++) {
Node n2 = n0.getEdge(j).getOpposite(n0);
if (n2.hasEdgeBetween(n1id)) count++;
}
}
}
end = System.currentTimeMillis();
measureValues.put(Measures.TRIANGLE, end - start);
return count / 3;
}
