public Edge[] incomingEdges(Vertex v) {
		int n = inValence(v);
		Edge[] answer = new Edge[n];
		Edge e = vertices.getFirstIncomingEdge(v);
		for (int i = 0; i < n; i++) {
			answer[i] = e;
			e = edges.getNextEdgeWithSameTo(e);
		}
		return answer;
	}
Returns an array of all incoming edges.
Ghidra/Framework/Generic/src/main/java/ghidra/util/graph/DirectedGraph.java