public default Collection<V> getSuccessors(V v) {
		Set<V> result = new LinkedHashSet<>();
		for (E edge : getOutEdges(v)) {
			result.add(edge.getEnd());
		}
		return result;
	}
Compute a vertex's successors

The default implementation compute this from the out-edges

NOTE: If a non-default implementation is provided, it ought to return cached results if
available

@param v the source vertex
@return the successors
Ghidra/Framework/Graph/src/main/java/ghidra/graph/GImplicitDirectedGraph.java