Github user dkuppitz commented on the issue: https://github.com/apache/tinkerpop/pull/777 I agree this test should run for all GraphComputers, but the test may not try to mutate the graph, as the test suite will run the test against a whole bunch of immutable graphs. Assuming that all we need is a pair 2 vertices connected via 2 edges in opposite directions, we could use the Grateful Dead graph; this pattern occurs 1476 times in it.
---