address comment

src/graph/validator/MatchValidator.cpp

@@ -170,7 +170,7 @@ Status MatchValidator::buildPathExpr(const MatchPath *path,
       auto min = range->min();
       if (min != 0 && min != 1) {
         return Status::SemanticError(
-            "`shortestPath(...)' does not support a minimal length different from 0 or 1");
+            "The minimal number of steps for shortestPath() must be either 0 or 1.");
       }
     }
     pathInfo.pathType = static_cast<Path::PathType>(pathType);

tests/tck/features/match/AllShortestPaths.feature

@@ -6,6 +6,40 @@ Feature: allShortestPaths
   Background:
     Given a graph with space named "nba"
 
+  Scenario: shortest path invalid step
+    When executing query:
+      """
+      WITH ["Tim Duncan","Tony Parker"] as list1
+      MATCH allShortestPaths((v1:player)-[e*2]-(v2:player))
+        WHERE id(v1) in list1 AND id(v2) in list1
+        RETURN e
+      """
+    Then a SemanticError should be raised at runtime: The minimal number of steps for shortestPath() must be either 0 or 1.
+    When executing query:
+      """
+      WITH ["Tim Duncan","Tony Parker"] as list1
+      MATCH allShortestPaths((v1:player)-[e*2..4]-(v2:player))
+        WHERE id(v1) in list1 AND id(v2) in list1
+        RETURN e
+      """
+    Then a SemanticError should be raised at runtime: The minimal number of steps for shortestPath() must be either 0 or 1.
+    When executing query:
+      """
+      WITH ["Tim Duncan","Tony Parker"] as list1
+      MATCH allShortestPaths((v1:player)-[e]->(b)--(v2:player))
+        WHERE id(v1) in list1 AND id(v2) in list1
+        RETURN e
+      """
+    Then a SemanticError should be raised at runtime: `shortestPath(...)' only support pattern like (start)-[edge*..hop]-(end)
+    When executing query:
+      """
+      WITH ["Tim Duncan","Tony Parker"] as list1
+      MATCH allShortestPaths((v1:player)-[e]->(b)-[e2:like]-(v2:player))
+        WHERE id(v1) in list1 AND id(v2) in list1
+        RETURN e
+      """
+    Then a SemanticError should be raised at runtime: `shortestPath(...)' only support pattern like (start)-[edge*..hop]-(end)
+
   Scenario: zero step shortest path
     When executing query:
       """

tests/tck/features/match/SingleShorestPath.feature

@@ -6,6 +6,40 @@ Feature: single shortestPath
   Background:
     Given a graph with space named "nba"
 
+  Scenario: shortest path invalid step
+    When executing query:
+      """
+      WITH ["Tim Duncan","Tony Parker"] as list1
+      MATCH shortestPath((v1:player)-[e*2]-(v2:player))
+        WHERE id(v1) in list1 AND id(v2) in list1
+        RETURN e
+      """
+    Then a SemanticError should be raised at runtime: The minimal number of steps for shortestPath() must be either 0 or 1.
+    When executing query:
+      """
+      WITH ["Tim Duncan","Tony Parker"] as list1
+      MATCH shortestPath((v1:player)-[e*2..4]-(v2:player))
+        WHERE id(v1) in list1 AND id(v2) in list1
+        RETURN e
+      """
+    Then a SemanticError should be raised at runtime: The minimal number of steps for shortestPath() must be either 0 or 1.
+    When executing query:
+      """
+      WITH ["Tim Duncan","Tony Parker"] as list1
+      MATCH shortestPath((v1:player)-[e]->(b)--(v2:player))
+        WHERE id(v1) in list1 AND id(v2) in list1
+        RETURN e
+      """
+    Then a SemanticError should be raised at runtime: `shortestPath(...)' only support pattern like (start)-[edge*..hop]-(end)
+    When executing query:
+      """
+      WITH ["Tim Duncan","Tony Parker"] as list1
+      MATCH shortestPath((v1:player)-[e]->(b)-[e2:like]-(v2:player))
+        WHERE id(v1) in list1 AND id(v2) in list1
+        RETURN e
+      """
+    Then a SemanticError should be raised at runtime: `shortestPath(...)' only support pattern like (start)-[edge*..hop]-(end)
+
   Scenario: zero step shortestpath
     When executing query:
       """