public Set<V> getPredecessors(V v) {
		Set<V> set = new HashSet<>();
		int index = pathList.indexOf(v);
		if (index < 0) {
			return set;
		}

		set.addAll(pathList.subList(0, index + 1)); // include the vertex
		return set;
	}
Return a set with all of the predecessors of the vertex in the GraphPath.

@param v the vertex we want to get the predecessors of
@return the predecessors of the vertex as a set, return empty set if there are none
Ghidra/Framework/Graph/src/main/java/ghidra/graph/GraphPath.java