114115116117118119120121122123124
//Seed the seach Q NodeIterable iter = hgraph.getNodes(); for (Node first : iter) { if (color[indicies.get(first)] == 0) { Q.add(first); iter.doBreak(); break; } } //While there are more nodes to search
196197198199200201202203204205206
Node first = null; NodeIterable iter = hgraph.getNodes(); for (Node u : iter) { if (index[indicies.get(u)] == 0) { first = u; iter.doBreak(); break; } } if (first == null) { hgraph.readUnlockAll();
147148149150151152153154155156157
//Seed the seach Q NodeIterable iter = graph.getNodes(); for (Node first : iter) { if (color[indicies.get(first)] == 0) { Q.add(first); iter.doBreak(); break; } } //While there are more nodes to search
269270271272273274275276277278279
Node first = null; NodeIterable iter = graph.getNodes(); for (Node u : iter) { if (index[indicies.get(u)] == 0) { first = u; iter.doBreak(); break; } } if (first == null) { return allComponents;