/**
* To avoid large processing and a large HashMap remove nodes with no edges up front
*
* @return removed nodes
*/
int removeZeroDegreeNodes() {
int removed = 0;
int locs = g.nodes();
for (int start = 0; start < locs; start++) {
if (!g.getEdges(start).next()) {
removed++;
g.markNodeRemoved(start);
}
}
return removed;
}
