You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@tinkerpop.apache.org by dk...@apache.org on 2018/08/09 17:33:09 UTC
tinkerpop git commit: added withComputer() in shortestPath() Gherkin
tests
Repository: tinkerpop
Updated Branches:
refs/heads/TINKERPOP-1990 91af0a2bf -> f24326f8c
added withComputer() in shortestPath() Gherkin tests
Project: http://git-wip-us.apache.org/repos/asf/tinkerpop/repo
Commit: http://git-wip-us.apache.org/repos/asf/tinkerpop/commit/f24326f8
Tree: http://git-wip-us.apache.org/repos/asf/tinkerpop/tree/f24326f8
Diff: http://git-wip-us.apache.org/repos/asf/tinkerpop/diff/f24326f8
Branch: refs/heads/TINKERPOP-1990
Commit: f24326f8c6369d326c0c836afea8d709257df5ab
Parents: 91af0a2
Author: Daniel Kuppitz <da...@hotmail.com>
Authored: Thu Aug 9 10:33:04 2018 -0700
Committer: Daniel Kuppitz <da...@hotmail.com>
Committed: Thu Aug 9 10:33:04 2018 -0700
----------------------------------------------------------------------
gremlin-test/features/map/ShortestPath.feature | 30 ++++++++++-----------
1 file changed, 15 insertions(+), 15 deletions(-)
----------------------------------------------------------------------
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/f24326f8/gremlin-test/features/map/ShortestPath.feature
----------------------------------------------------------------------
diff --git a/gremlin-test/features/map/ShortestPath.feature b/gremlin-test/features/map/ShortestPath.feature
index 0029f9d..c361b6d 100644
--- a/gremlin-test/features/map/ShortestPath.feature
+++ b/gremlin-test/features/map/ShortestPath.feature
@@ -21,7 +21,7 @@ Feature: Step - shortestPath()
Given the modern graph
And the traversal of
"""
- g.V().shortestPath()
+ g.withComputer().V().shortestPath()
"""
When iterated to list
Then the result should be unordered
@@ -67,7 +67,7 @@ Feature: Step - shortestPath()
Given the modern graph
And the traversal of
"""
- g.V().both().dedup().shortestPath()
+ g.withComputer().V().both().dedup().shortestPath()
"""
When iterated to list
Then the result should be unordered
@@ -113,7 +113,7 @@ Feature: Step - shortestPath()
Given the modern graph
And the traversal of
"""
- g.V().shortestPath().with(includeEdges, true)
+ g.withComputer().V().shortestPath().with(includeEdges, true)
"""
When iterated to list
Then the result should be unordered
@@ -159,7 +159,7 @@ Feature: Step - shortestPath()
Given the modern graph
And the traversal of
"""
- g.V().shortestPath().with(edges, Direction.IN)
+ g.withComputer().V().shortestPath().with(edges, Direction.IN)
"""
When iterated to list
Then the result should be unordered
@@ -182,7 +182,7 @@ Feature: Step - shortestPath()
Given the modern graph
And the traversal of
"""
- g.V().shortestPath().with(edges, __.outE())
+ g.withComputer().V().shortestPath().with(edges, __.outE())
"""
When iterated to list
Then the result should be unordered
@@ -205,7 +205,7 @@ Feature: Step - shortestPath()
Given the modern graph
And the traversal of
"""
- g.V().shortestPath().with(includeEdges, true).with(edges, __.outE())
+ g.withComputer().V().shortestPath().with(includeEdges, true).with(edges, __.outE())
"""
When iterated to list
Then the result should be unordered
@@ -228,7 +228,7 @@ Feature: Step - shortestPath()
Given the modern graph
And the traversal of
"""
- g.V().has("name", "marko").shortestPath()
+ g.withComputer().V().has("name", "marko").shortestPath()
"""
When iterated to list
Then the result should be unordered
@@ -244,7 +244,7 @@ Feature: Step - shortestPath()
Given the modern graph
And the traversal of
"""
- g.V().shortestPath().with(target, __.has("name", "marko"))
+ g.withComputer().V().shortestPath().with(target, __.has("name", "marko"))
"""
When iterated to list
Then the result should be unordered
@@ -260,7 +260,7 @@ Feature: Step - shortestPath()
Given the modern graph
And the traversal of
"""
- g.V().shortestPath().with(target, __.values("name").is("marko"))
+ g.withComputer().V().shortestPath().with(target, __.values("name").is("marko"))
"""
When iterated to list
Then the result should be unordered
@@ -276,7 +276,7 @@ Feature: Step - shortestPath()
Given the modern graph
And the traversal of
"""
- g.V().has("name", "marko").shortestPath().with(target, __.hasLabel("software"))
+ g.withComputer().V().has("name", "marko").shortestPath().with(target, __.hasLabel("software"))
"""
When iterated to list
Then the result should be unordered
@@ -288,7 +288,7 @@ Feature: Step - shortestPath()
Given the modern graph
And the traversal of
"""
- g.V().has("name", "marko").shortestPath().with(target, __.has("name","josh")).with(distance, "weight")
+ g.withComputer().V().has("name", "marko").shortestPath().with(target, __.has("name","josh")).with(distance, "weight")
"""
When iterated to list
Then the result should be unordered
@@ -299,7 +299,7 @@ Feature: Step - shortestPath()
Given the crew graph
And the traversal of
"""
- g.V().has("name", "daniel").shortestPath().with(target, __.has("name","stephen")).with(edges, __.bothE("uses"))
+ g.withComputer().V().has("name", "daniel").shortestPath().with(target, __.has("name","stephen")).with(edges, __.bothE("uses"))
"""
When iterated to list
Then the result should be unordered
@@ -311,7 +311,7 @@ Feature: Step - shortestPath()
Given the grateful dead graph
And the traversal of
"""
- g.V().has("song", "name", "MIGHT AS WELL").
+ g.withComputer().V().has("song", "name", "MIGHT AS WELL").
shortestPath().
with(target, __.has("song", "name", "MAYBE YOU KNOW HOW I FEEL")).
with(edges, __.outE("followedBy")).
@@ -327,7 +327,7 @@ Feature: Step - shortestPath()
Given the modern graph
And the traversal of
"""
- g.V().has("name", "marko").shortestPath().with(maxDistance, 1)
+ g.withComputer().V().has("name", "marko").shortestPath().with(maxDistance, 1)
"""
When iterated to list
Then the result should be unordered
@@ -341,7 +341,7 @@ Feature: Step - shortestPath()
Given the modern graph
And the traversal of
"""
- g.V().has("name", "vadas").shortestPath().with(distance, "weight").with(maxDistance, 1.3)
+ g.withComputer().V().has("name", "vadas").shortestPath().with(distance, "weight").with(maxDistance, 1.3)
"""
When iterated to list
Then the result should be unordered