public Edge[] getEdges(Vertex from, Vertex to) {
		Edge e;
		Set<Edge> outgoingEdges = this.getOutgoingEdges(from);
		Iterator<Edge> iter = outgoingEdges.iterator();
		while (iter.hasNext()) {
			e = iter.next();
			if (e.to() != to) {
				iter.remove();
			}
		}
		return outgoingEdges.toArray(new Edge[0]);
	}
Returns all edges joing the from and to vertices. Recall DirectedGraph
uses a multigraph model where parallel edges are allowed.
Ghidra/Framework/Generic/src/main/java/ghidra/util/graph/DirectedGraph.java