public void intersectionWith(DirectedGraph otherGraph) {
		GraphIterator<Vertex> vi = otherGraph.vertices.iterator();
		Vertex v;
		while (vi.hasNext()) {
			v = vi.next();
			if (!this.contains(v)) {
				vi.remove();
			}
		}
		GraphIterator<Edge> ei = otherGraph.edgeIterator();
		Edge e;
		while (ei.hasNext()) {
			e = ei.next();
			if (!this.contains(e)) {
				ei.remove();
			}
		}
	}
Creates intersection of graphs in place by adding all vertices and edges of
other graph to this graph. This method used to return a different graph
as the intersection but now does not.
Ghidra/Framework/Generic/src/main/java/ghidra/util/graph/DirectedGraph.java