diff --git a/tests/tck/features/match/AllShortestPaths.feature b/tests/tck/features/match/AllShortestPaths.feature index 8045681ae83..1f8b977b675 100644 --- a/tests/tck/features/match/AllShortestPaths.feature +++ b/tests/tck/features/match/AllShortestPaths.feature @@ -6,6 +6,24 @@ Feature: allShortestPaths Background: Given a graph with space named "nba" + Scenario: zero step shortest path + When executing query: + """ + WITH ["Tim Duncan","Tony Parker"] as list1 + MATCH allShortestPaths((v1:player)-[e*0]-(v2:player)) + WHERE id(v1) in list1 AND id(v2) in list1 + RETURN e + """ + Then the result should be, in any order, with relax comparison: + | e | + When executing query: + """ + MATCH allShortestPaths((v1:player{name:"Tim Duncan"})-[e*0]-(v2:player{name:"Tony Parker"})) + RETURN e + """ + Then the result should be, in any order, with relax comparison: + | e | + Scenario: one step shortest path When executing query: """ diff --git a/tests/tck/features/match/SingleShorestPath.feature b/tests/tck/features/match/SingleShorestPath.feature index b7e74473073..cf61447057b 100644 --- a/tests/tck/features/match/SingleShorestPath.feature +++ b/tests/tck/features/match/SingleShorestPath.feature @@ -6,6 +6,24 @@ Feature: single shortestPath Background: Given a graph with space named "nba" + Scenario: zero step shortestpath + When executing query: + """ + WITH ["Tim Duncan","Tony Parker"] as list1 + MATCH shortestPath((v1:player)-[e*0]-(v2:player)) + WHERE id(v1) in list1 AND id(v2) in list1 + RETURN e + """ + Then the result should be, in any order, with relax comparison: + | e | + When executing query: + """ + MATCH shortestPath((v1:player{name:"Tim Duncan"})-[e*0]-(v2:player{name:"Tony Parker"})) + RETURN e + """ + Then the result should be, in any order, with relax comparison: + | e | + Scenario: single shortestPath1 When executing query: """