public Set<Vertex> getChildren(Vertex v) {
		Set<Vertex> children = new HashSet<>();
		Edge e = vertices.getFirstOutgoingEdge(v);
		while (e != null) {
			children.add(e.to());
			e = edges.getNextEdgeWithSameFrom(e);
		}
		return children;
	}
Returns a Set (HashSet) containing all vertices that are the tos
  of outgoing edges of the given vertex. Note in the case of multiple
 edges, the number of children and outvalence need not be the same.
Ghidra/Framework/Generic/src/main/java/ghidra/util/graph/DirectedGraph.java