int degree = v.GetNeighborNames().length;
if (degree > maxDegree) { maxDegree = degree; }
if (degree < minDegree) { minDegree = degree; }
totalEdges += v.neighbors().size();
if (v.isSeedNode()) { ++totalSeedNodes; }
if (v.isTestNode()) { ++totalTestNodes; }
if (v.isSeedNode() && v.isTestNode()) { ++totalSeedAndTestNodes; }
}