@Test
    @LoadGraphWith(GRATEFUL)
    public void shouldFindEqualLengthPathsUsingDistanceProperty() throws Exception {
        final ComputerResult result = graph.compute(graphProvider.getGraphComputer(graph).getClass()).
                program(ShortestPathVertexProgram.build()
                        .edgeTraversal(__.outE("followedBy"))
                        .source(__.has("song", "name", "MIGHT AS WELL"))
                        .target(__.has("song", "name", "MAYBE YOU KNOW HOW I FEEL"))
                        .distanceProperty("weight")
                        .create(graph)).submit().get();
        assertTrue(result.memory().exists(ShortestPathVertexProgram.SHORTEST_PATHS));
        final List<Path> shortestPaths = result.memory().get(ShortestPathVertexProgram.SHORTEST_PATHS);
        final List<Path> expected = Arrays.asList(
                helper.makePath("MIGHT AS WELL", "DRUMS", "MAYBE YOU KNOW HOW I FEEL"),
                helper.makePath("MIGHT AS WELL", "SHIP OF FOOLS", "MAYBE YOU KNOW HOW I FEEL"));
        helper.checkResults(expected, shortestPaths);
    }
@author Daniel Kuppitz (http://gremlin.guru)
gremlin-test/src/main/java/org/apache/tinkerpop/gremlin/process/computer/search/path/ShortestPathVertexProgramTest.java