@Override
	public default Collection<V> getPredecessors(V v) {
		Set<V> result = new LinkedHashSet<>();
		for (E edge : getInEdges(v)) {
			result.add(edge.getStart());
		}
		return result;
	}
Compute a vertex's predecessors

<P>
The default implementation computes this from the in-edges

@param v the destination vertex
@return the predecessors
Ghidra/Framework/Graph/src/main/java/ghidra/graph/GDirectedGraph.java