From 05b7256e891659345f26c2ebf8c07e91469cc557 Mon Sep 17 00:00:00 2001 From: Reneta Popova Date: Tue, 22 Oct 2024 09:47:26 +0100 Subject: [PATCH] Fix the example of shortest path with an unbounded pattern --- .../pages/notifications/all-notifications.adoc | 16 ++++++++++++---- 1 file changed, 12 insertions(+), 4 deletions(-) diff --git a/modules/ROOT/pages/notifications/all-notifications.adoc b/modules/ROOT/pages/notifications/all-notifications.adoc index 9043f11b..19514198 100644 --- a/modules/ROOT/pages/notifications/all-notifications.adoc +++ b/modules/ROOT/pages/notifications/all-notifications.adoc @@ -151,7 +151,9 @@ Query:: + [source, cypher, role="noplay"] ---- -MATCH p=shortestPath((n)-[*]->(m)) RETURN p +MATCH p=shortestPath((n)-[*]->(m)) +WHERE n <> m +RETURN p ---- Description of the returned code:: @@ -164,7 +166,9 @@ Consider adding an upper limit. + [source, cypher, role="noplay"] ---- -MATCH p=shortestPath((n)-[*..8]->(m)) RETURN p +MATCH p=shortestPath((n)-[*..8]->(m)) +WHERE n <> m +RETURN p ---- ====== [.include-with-GQLSTATUS-code] @@ -174,7 +178,9 @@ Query:: + [source, cypher, role="noplay"] ---- -MATCH p=shortestPath((n)-[*]->(m)) RETURN p +MATCH p=shortestPath((n)-[*]->(m)) +WHERE n <> m +RETURN p ---- Returned GQLSTATUS code:: @@ -192,7 +198,9 @@ Consider adding an upper limit. + [source, cypher, role="noplay"] ---- -MATCH p=shortestPath((n)-[*..8]->(m)) RETURN p +MATCH p=shortestPath((n)-[*..8]->(m)) +WHERE n <> m +RETURN p ---- ====== =====