Examples with DefaultGraphTraversal org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.DefaultGraphTraversal used on opensource projects

Example 6 with DefaultGraphTraversal

use of org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.DefaultGraphTraversal in project sqlg by pietermartin.

the class TestLocalVertexStepOptionalWithOrder method testUmlgRequirement.

/**
 * optionals wrapped in local steps.
 * The idea is that each traversed out/in edge needs to be sorted
 */
@Test
public void testUmlgRequirement() {
    Vertex a1 = this.sqlgGraph.addVertex(T.label, "A", "name", "a1");
    Vertex a2 = this.sqlgGraph.addVertex(T.label, "A", "name", "a2");
    Vertex b1 = this.sqlgGraph.addVertex(T.label, "B", "name", "b1");
    Vertex b2 = this.sqlgGraph.addVertex(T.label, "B", "name", "b2");
    Vertex b3 = this.sqlgGraph.addVertex(T.label, "B", "name", "b3");
    Vertex bb1 = this.sqlgGraph.addVertex(T.label, "BB", "name", "bb1");
    Vertex bb2 = this.sqlgGraph.addVertex(T.label, "BB", "name", "bb2");
    Vertex bb3 = this.sqlgGraph.addVertex(T.label, "BB", "name", "bb3");
    a1.addEdge("ab", b1, "order", 3);
    a1.addEdge("ab", b2, "order", 2);
    a1.addEdge("ab", b3, "order", 1);
    a1.addEdge("abb", bb1, "order", 3);
    a1.addEdge("abb", bb2, "order", 2);
    a1.addEdge("abb", bb3, "order", 1);
    Vertex c1 = this.sqlgGraph.addVertex(T.label, "C", "name", "c1");
    Vertex c2 = this.sqlgGraph.addVertex(T.label, "C", "name", "c2");
    Vertex c3 = this.sqlgGraph.addVertex(T.label, "C", "name", "c3");
    b1.addEdge("bc", c1, "order", 1);
    b1.addEdge("bc", c2, "order", 2);
    b1.addEdge("bc", c3, "order", 3);
    Vertex cc1 = this.sqlgGraph.addVertex(T.label, "CC", "name", "cc1");
    Vertex cc2 = this.sqlgGraph.addVertex(T.label, "CC", "name", "cc2");
    Vertex cc3 = this.sqlgGraph.addVertex(T.label, "CC", "name", "cc3");
    b1.addEdge("bcc", cc1, "order", 3);
    b1.addEdge("bcc", cc2, "order", 2);
    b1.addEdge("bcc", cc3, "order", 1);
    this.sqlgGraph.tx().commit();
    DefaultGraphTraversal<Vertex, Path> traversal = (DefaultGraphTraversal<Vertex, Path>) sqlgGraph.traversal().V().hasLabel("A").as("a").order().by("name", Order.decr).local(__.optional(__.outE().as("e1").inV().as("b").order().by(T.label).by(__.select("e1").by("order")).local(__.optional(__.outE().as("e2").inV().order().by(T.label).by(__.select("e2").by("order")))))).path();
    Assert.assertEquals(5, traversal.getSteps().size());
    List<Path> paths = traversal.toList();
    Assert.assertEquals(4, traversal.getSteps().size());
    Assert.assertTrue(traversal.getSteps().get(2) instanceof SqlgLocalStepBarrier);
    SqlgLocalStepBarrier sqlgLocalStepBarrier = (SqlgLocalStepBarrier) traversal.getSteps().get(2);
    DefaultGraphTraversal<Vertex, Vertex> t = (DefaultGraphTraversal<Vertex, Vertex>) sqlgLocalStepBarrier.getLocalChildren().get(0);
    // First optional is a non optimized, optimized SqlgOptionalBarrierStep
    Assert.assertEquals(1, t.getSteps().size());
    Assert.assertTrue(t.getSteps().get(0) instanceof SqlgOptionalStepBarrier);
    SqlgOptionalStepBarrier sqlgOptionalStepBarrier = (SqlgOptionalStepBarrier) t.getSteps().get(0);
    Traversal.Admin<?, ?> optionalTraversal = (Traversal.Admin<?, ?>) sqlgOptionalStepBarrier.getLocalChildren().get(0);
    Assert.assertEquals(2, optionalTraversal.getSteps().size());
    Assert.assertTrue(optionalTraversal.getSteps().get(0) instanceof SqlgVertexStep);
    Assert.assertTrue(optionalTraversal.getSteps().get(1) instanceof SqlgLocalStepBarrier);
    SqlgLocalStepBarrier sqlgLocalStepBarrier1 = (SqlgLocalStepBarrier) optionalTraversal.getSteps().get(1);
    t = (DefaultGraphTraversal<Vertex, Vertex>) sqlgLocalStepBarrier.getLocalChildren().get(0);
    // Second optional is a optimized
    Assert.assertEquals(1, t.getSteps().size());
    Assert.assertEquals(12, paths.size());
    Path pathX = paths.get(0);
    Assert.assertEquals(1, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a2));
    pathX = paths.get(1);
    Assert.assertEquals(3, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b3));
    pathX = paths.get(2);
    Assert.assertEquals(3, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b2));
    pathX = paths.get(3);
    Assert.assertEquals(5, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b1));
    Assert.assertTrue(pathX.get(4).equals(c1));
    pathX = paths.get(4);
    Assert.assertEquals(5, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b1));
    Assert.assertTrue(pathX.get(4).equals(c2));
    pathX = paths.get(5);
    Assert.assertEquals(5, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b1));
    Assert.assertTrue(pathX.get(4).equals(c3));
    pathX = paths.get(6);
    Assert.assertEquals(5, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b1));
    Assert.assertTrue(pathX.get(4).equals(cc3));
    pathX = paths.get(7);
    Assert.assertEquals(5, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b1));
    Assert.assertTrue(pathX.get(4).equals(cc2));
    pathX = paths.get(8);
    Assert.assertEquals(5, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b1));
    Assert.assertTrue(pathX.get(4).equals(cc1));
    pathX = paths.get(9);
    Assert.assertEquals(3, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    for (Path path : paths) {
        for (Object v : path.objects()) {
            Element vertex = (Element) v;
            if (vertex instanceof Vertex) {
                System.out.print(vertex.<String>value("name"));
                System.out.print(" - ");
            }
        }
    }
}

Example 7 with DefaultGraphTraversal

use of org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.DefaultGraphTraversal in project sqlg by pietermartin.

the class TestLocalVertexStepOptionalWithOrder method testOptionalWithOrderAndRange2.

@Test
public void testOptionalWithOrderAndRange2() {
    Vertex a1 = this.sqlgGraph.addVertex(T.label, "A", "name", "a");
    Vertex a2 = this.sqlgGraph.addVertex(T.label, "A", "name", "aa");
    Vertex a3 = this.sqlgGraph.addVertex(T.label, "A", "name", "aaa");
    Vertex b1 = this.sqlgGraph.addVertex(T.label, "B", "name", "d");
    Vertex b2 = this.sqlgGraph.addVertex(T.label, "B", "name", "c");
    Vertex b3 = this.sqlgGraph.addVertex(T.label, "B", "name", "b");
    Vertex bb1 = this.sqlgGraph.addVertex(T.label, "BB", "name", "g");
    Vertex bb2 = this.sqlgGraph.addVertex(T.label, "BB", "name", "f");
    Vertex bb3 = this.sqlgGraph.addVertex(T.label, "BB", "name", "e");
    Vertex c1 = this.sqlgGraph.addVertex(T.label, "C", "name", "h");
    Vertex c2 = this.sqlgGraph.addVertex(T.label, "C", "name", "i");
    Vertex c3 = this.sqlgGraph.addVertex(T.label, "C", "name", "j");
    Vertex cc1 = this.sqlgGraph.addVertex(T.label, "CC", "name", "k");
    Vertex cc2 = this.sqlgGraph.addVertex(T.label, "CC", "name", "l");
    Vertex cc3 = this.sqlgGraph.addVertex(T.label, "CC", "name", "m");
    a1.addEdge("ab", b1);
    a1.addEdge("ab", b2);
    a1.addEdge("ab", b3);
    a1.addEdge("abb", bb1);
    a1.addEdge("abb", bb2);
    a1.addEdge("abb", bb3);
    b1.addEdge("bc", c1);
    b1.addEdge("bc", c2);
    b1.addEdge("bc", c3);
    b2.addEdge("bcc", cc1);
    b2.addEdge("bcc", cc2);
    b2.addEdge("bcc", cc3);
    this.sqlgGraph.tx().commit();
    DefaultGraphTraversal<Vertex, Path> traversal = (DefaultGraphTraversal<Vertex, Path>) this.sqlgGraph.traversal().V().hasLabel("A").local(__.optional(__.out().order().by("name").range(1, 2).optional(__.out().order().by("name", Order.decr).range(2, 3)))).path();
    Assert.assertEquals(4, traversal.getSteps().size());
    List<Path> paths = traversal.toList();
    // This query is no fully optimized.
    // The range messes it up, so it has a SqlgVertexStep
    Assert.assertEquals(3, traversal.getSteps().size());
    Assert.assertTrue(traversal.getSteps().get(1) instanceof LocalStep);
    LocalStep<?, ?> localStep = (LocalStep<?, ?>) traversal.getSteps().get(1);
    List<SqlgVertexStep> sqlgVertexSteps = TraversalHelper.getStepsOfAssignableClassRecursively(SqlgVertexStep.class, localStep.getLocalChildren().get(0));
    // first optional step can not be optimized because it has a range step that is not the last step
    // the second is optimized.
    Assert.assertEquals(2, sqlgVertexSteps.size());
    Assert.assertEquals(3, paths.size());
    List<Path> pathsOfLength1 = paths.stream().filter(p -> p.size() == 1).collect(Collectors.toList());
    Assert.assertEquals(2, pathsOfLength1.size());
    List<Path> pathsOfLength3 = paths.stream().filter(p -> p.size() == 3).collect(Collectors.toList());
    Assert.assertEquals(1, pathsOfLength3.size());
    Vertex v = (Vertex) pathsOfLength3.get(0).objects().get(2);
    Assert.assertEquals("k", v.value("name"));
}

Example 8 with DefaultGraphTraversal

use of org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.DefaultGraphTraversal in project sqlg by pietermartin.

the class TestLocalVertexStepWithOrder method testSqlgVertexStepOrderStartsProperly.

@Test
public void testSqlgVertexStepOrderStartsProperly() {
    Vertex a1 = this.sqlgGraph.addVertex(T.label, "A", "name", "a1", "order", 1);
    Vertex a2 = this.sqlgGraph.addVertex(T.label, "A", "name", "a2", "order", 2);
    Vertex b1 = this.sqlgGraph.addVertex(T.label, "B", "name", "b1");
    Vertex b2 = this.sqlgGraph.addVertex(T.label, "B", "name", "b2");
    Vertex b3 = this.sqlgGraph.addVertex(T.label, "B", "name", "b3");
    a1.addEdge("ab", b1, "order", 1);
    a1.addEdge("ab", b2, "order", 2);
    a1.addEdge("ab", b3, "order", 3);
    a2.addEdge("ab", b1, "order", 1);
    a2.addEdge("ab", b2, "order", 2);
    a2.addEdge("ab", b3, "order", 3);
    Vertex c1 = this.sqlgGraph.addVertex(T.label, "C", "name", "c1", "order", 1);
    Vertex c2 = this.sqlgGraph.addVertex(T.label, "C", "name", "c2", "order", 2);
    Vertex c3 = this.sqlgGraph.addVertex(T.label, "C", "name", "c3", "order", 3);
    Vertex c4 = this.sqlgGraph.addVertex(T.label, "C", "name", "c4", "order", 1);
    Vertex c5 = this.sqlgGraph.addVertex(T.label, "C", "name", "c5", "order", 2);
    Vertex c6 = this.sqlgGraph.addVertex(T.label, "C", "name", "c6", "order", 3);
    Vertex c7 = this.sqlgGraph.addVertex(T.label, "C", "name", "c7", "order", 1);
    Vertex c8 = this.sqlgGraph.addVertex(T.label, "C", "name", "c8", "order", 2);
    Vertex c9 = this.sqlgGraph.addVertex(T.label, "C", "name", "c9", "order", 3);
    b1.addEdge("bc", c1);
    b1.addEdge("bc", c2);
    b1.addEdge("bc", c3);
    b2.addEdge("bc", c4);
    b2.addEdge("bc", c5);
    b2.addEdge("bc", c6);
    b3.addEdge("bc", c7);
    b3.addEdge("bc", c8);
    b3.addEdge("bc", c9);
    this.sqlgGraph.tx().commit();
    DefaultGraphTraversal<Vertex, Path> traversal = (DefaultGraphTraversal<Vertex, Path>) this.sqlgGraph.traversal().V().hasLabel("A").order().by("order").local(__.outE("ab").order().by("order", Order.decr).inV().local(__.out("bc").order().by("order", Order.decr))).path();
    List<Path> paths = traversal.toList();
    for (Path path : paths) {
        System.out.println(path.toString() + " " + ((Vertex) path.objects().get(3)).<String>value("name"));
    }
    Assert.assertEquals(18, paths.size());
    Assert.assertEquals(a1, paths.get(0).objects().get(0));
    Assert.assertEquals(c9, paths.get(0).objects().get(3));
    Assert.assertEquals(a1, paths.get(1).objects().get(0));
    Assert.assertEquals(c8, paths.get(1).objects().get(3));
    Assert.assertEquals(a1, paths.get(2).objects().get(0));
    Assert.assertEquals(c7, paths.get(2).objects().get(3));
    Assert.assertEquals(a1, paths.get(3).objects().get(0));
    Assert.assertEquals(c6, paths.get(3).objects().get(3));
    Assert.assertEquals(a1, paths.get(4).objects().get(0));
    Assert.assertEquals(c5, paths.get(4).objects().get(3));
    Assert.assertEquals(a1, paths.get(5).objects().get(0));
    Assert.assertEquals(c4, paths.get(5).objects().get(3));
    Assert.assertEquals(a1, paths.get(6).objects().get(0));
    Assert.assertEquals(c3, paths.get(6).objects().get(3));
    Assert.assertEquals(a1, paths.get(7).objects().get(0));
    Assert.assertEquals(c2, paths.get(7).objects().get(3));
    Assert.assertEquals(a1, paths.get(8).objects().get(0));
    Assert.assertEquals(c1, paths.get(8).objects().get(3));
    Assert.assertEquals(a2, paths.get(9).objects().get(0));
    Assert.assertEquals(c9, paths.get(9).objects().get(3));
    Assert.assertEquals(a2, paths.get(10).objects().get(0));
    Assert.assertEquals(c8, paths.get(10).objects().get(3));
    Assert.assertEquals(a2, paths.get(11).objects().get(0));
    Assert.assertEquals(c7, paths.get(11).objects().get(3));
    Assert.assertEquals(a2, paths.get(12).objects().get(0));
    Assert.assertEquals(c6, paths.get(12).objects().get(3));
    Assert.assertEquals(a2, paths.get(13).objects().get(0));
    Assert.assertEquals(c5, paths.get(13).objects().get(3));
    Assert.assertEquals(a2, paths.get(14).objects().get(0));
    Assert.assertEquals(c4, paths.get(14).objects().get(3));
    Assert.assertEquals(a2, paths.get(15).objects().get(0));
    Assert.assertEquals(c3, paths.get(15).objects().get(3));
    Assert.assertEquals(a2, paths.get(16).objects().get(0));
    Assert.assertEquals(c2, paths.get(16).objects().get(3));
    Assert.assertEquals(a2, paths.get(17).objects().get(0));
    Assert.assertEquals(c1, paths.get(17).objects().get(3));
}

Example 9 with DefaultGraphTraversal

use of org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.DefaultGraphTraversal in project sqlg by pietermartin.

the class TestVertexStepPerformance method testGroup.

// TODO group is not optimized
// @Test
public void testGroup() {
    loadGratefulDead();
    for (int i = 0; i < 10000; i++) {
        StopWatch stopWatch = new StopWatch();
        stopWatch.start();
        DefaultGraphTraversal<Vertex, Map<String, Map<String, Number>>> traversal = (DefaultGraphTraversal<Vertex, Map<String, Map<String, Number>>>) this.sqlgGraph.traversal().V().out("followedBy").<String, Map<String, Number>>group().by("songType").by(__.bothE().group().by(T.label).by(__.values("weight").sum()));
        final Map<String, Map<String, Number>> map = traversal.next();
        stopWatch.stop();
        System.out.println(stopWatch.toString());
    }
}

Example 10 with DefaultGraphTraversal

use of org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.DefaultGraphTraversal in project sqlg by pietermartin.

the class TestVertexStepPerformance method testLocalVertexStepNotOptimizedPerformance.

// @Test
public void testLocalVertexStepNotOptimizedPerformance() {
    this.sqlgGraph.tx().normalBatchModeOn();
    for (int i = 0; i < 10_000; i++) {
        Vertex a1 = this.sqlgGraph.addVertex(T.label, "A", "name", "a1");
        Vertex a2 = this.sqlgGraph.addVertex(T.label, "A", "name", "a2");
        Vertex b1 = this.sqlgGraph.addVertex(T.label, "B", "name", "b1");
        a1.addEdge("ab", b1);
    }
    this.sqlgGraph.tx().commit();
    StopWatch stopWatch = new StopWatch();
    for (int i = 0; i < 1000; i++) {
        DefaultGraphTraversal<Vertex, Path> traversal = (DefaultGraphTraversal<Vertex, Path>) this.gt.V().local(__.optional(__.where(__.has(T.label, "A")).out())).path();
        stopWatch.start();
        List<Path> paths = traversal.toList();
        stopWatch.stop();
        System.out.println(stopWatch.toString());
        stopWatch.reset();
        Assert.assertEquals(30_000, paths.size());
    }
}