private void descendantsHelper(IndexedWord curr, Set<IndexedWord> descendantSet) { if (descendantSet.contains(curr)) { return; } descendantSet.add(curr); for (IndexedWord child : getChildren(curr)) { descendantsHelper(child, descendantSet); } }
/** * Returns the set of descendants governed by this node in the graph. * */ public Set<IndexedWord> descendants(IndexedWord vertex) { if (!containsVertex(vertex)) { throw new IllegalArgumentException(); } // Do a depth first search Set<IndexedWord> descendantSet = wordMapFactory.newSet(); descendantsHelper(vertex, descendantSet); return descendantSet; }
private void descendantsHelper(IndexedWord curr, Set<IndexedWord> descendantSet) { if (descendantSet.contains(curr)) { return; } descendantSet.add(curr); for (IndexedWord child : getChildren(curr)) { descendantsHelper(child, descendantSet); } }
private void descendantsHelper(IndexedWord curr, Set<IndexedWord> descendantSet) { if (descendantSet.contains(curr)) { return; } descendantSet.add(curr); for (IndexedWord child : getChildren(curr)) { descendantsHelper(child, descendantSet); } }
private void descendantsHelper(IndexedWord curr, Set<IndexedWord> descendantSet) { if (descendantSet.contains(curr)) { return; } descendantSet.add(curr); for (IndexedWord child : getChildList(curr)) { descendantsHelper(child, descendantSet); } }
/** * Returns the set of descendants governed by this node in the graph. * */ public Set<IndexedWord> descendants(IndexedWord vertex) { if (!vertexSet().contains(vertex)) { throw new IllegalArgumentException(); } // Do a depth first search Set<IndexedWord> descendantSet = Generics.newHashSet(); descendantsHelper(vertex, descendantSet); return descendantSet; }
/** * Returns the set of descendants governed by this node in the graph. * */ public Set<IndexedWord> descendants(IndexedWord vertex) { if (!containsVertex(vertex)) { throw new IllegalArgumentException(); } // Do a depth first search Set<IndexedWord> descendantSet = wordMapFactory.newSet(); descendantsHelper(vertex, descendantSet); return descendantSet; }
/** * Returns the set of descendants governed by this node in the graph. * */ public Set<IndexedWord> descendants(IndexedWord vertex) { if (!containsVertex(vertex)) { throw new IllegalArgumentException(); } // Do a depth first search Set<IndexedWord> descendantSet = wordMapFactory.newSet(); descendantsHelper(vertex, descendantSet); return descendantSet; }