private boolean sameOutVertices(final Vertex v, final List<Vertex> outVertices) {
        return outVertices.stream()
                .allMatch(outVertex ->
                {
                    final Iterator<Vertex> itty = v.vertices(Direction.OUT);
                    final boolean result = IteratorUtils.filter(itty, hv -> hv.value("oid").equals(outVertex.value("oid"))).hasNext();
                    CloseableIterator.closeIterator(itty);
                    return result;
                });
    }
Asserts that two graphs are the "same" in way of structure.  It assumes that the graphs both have vertices
with an "oid" property that is an Integer value.  It iterates each vertex in graph 1, using the "oid" to
lookup vertices in graph 2.  For each one found it checks both IN and OUT vertices to ensure that they
attach to the same IN/OUT vertices given their "oid" properties.
gremlin-test/src/main/java/org/apache/tinkerpop/gremlin/algorithm/generator/AbstractGeneratorTest.java