public boolean containsAsSubgraph(DirectedGraph g) {
		boolean test = true;
		GraphIterator<Edge> ei = g.edgeIterator();
		while (ei.hasNext() && test) {
			test = this.contains(ei.next());
		}
		GraphIterator<Vertex> vi = g.vertices.iterator();
		while (vi.hasNext() && test) {
			test = this.contains(vi.next());
		}
		return test;
	}
Returns true iff all nodes and edges of the given graph are in the current graph
Ghidra/Framework/Generic/src/main/java/ghidra/util/graph/DirectedGraph.java