public boolean areRelatedAs(Vertex parent, Vertex child) {
		Edge e;
		Set<Edge> outgoingEdges = this.getOutgoingEdges(parent);
		Iterator<Edge> iter = outgoingEdges.iterator();
		while (iter.hasNext()) {
			e = iter.next();
			if (e.to() == child) {
				return true;
			}
		}
		return false;
	}
Returns true iff the graph contains and edge from the parent vertex
to the child vertex.
Ghidra/Framework/Generic/src/main/java/ghidra/util/graph/DirectedGraph.java