public Set<Vertex> getChildren(Set<Vertex> vs) {
		Set<Vertex> children = new HashSet<>();
		Vertex v;
		Edge e;
		Iterator<Vertex> i = vs.iterator();
		while (i.hasNext()) {
			v = i.next();
			e = vertices.getFirstOutgoingEdge(v);
			while (e != null) {
				children.add(e.to());
				e = edges.getNextEdgeWithSameFrom(e);
			}
		}
		return children;
	}
Returns all children of the vertices in the given set.
Ghidra/Framework/Generic/src/main/java/ghidra/util/graph/DirectedGraph.java