From 7624f97ca3a38432103ec6c7f8935bb57a616e2b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Jens=20Pryce-=C3=85klundh?=
 <112686610+JPryce-Aklundh@users.noreply.github.com>
Date: Mon, 25 Aug 2025 15:33:33 +0200
Subject: [PATCH] add another criteria for when shortest queries are rewritten
 with legacy

---
 modules/ROOT/pages/patterns/shortest-paths.adoc | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/modules/ROOT/pages/patterns/shortest-paths.adoc b/modules/ROOT/pages/patterns/shortest-paths.adoc
index 5ef622f0b..e8d83f72e 100644
--- a/modules/ROOT/pages/patterns/shortest-paths.adoc
+++ b/modules/ROOT/pages/patterns/shortest-paths.adoc
@@ -845,6 +845,8 @@ Or, when the estimated cardinality of the source and target nodes in a shortest
 * Selector is one of: `SHORTEST 1`, `ANY`, `ANY SHORTEST`, `ALL SHORTEST`, `SHORTEST GROUP`, or `SHORTEST 1 GROUP`.
 * There is only one relationship pattern.
 * If the pattern is a xref:patterns/variable-length-patterns.adoc#quantified-path-patterns[quantified path pattern] in the form of `\(()-[]-())`, or is a  xref:patterns/variable-length-patterns.adoc#quantified-relationships[quantified-relationship], and it uses a filter that can be applied directly to the relationship.
+* If the pattern is a quantified path pattern or a quantified relationship and the relationship pattern is directed, the lower bound of the xref:patterns/reference.adoc#quantifiers[quantifier] is 0 or 1.
+If the relationship pattern is directed, the lower bound is 0.
 * In the case of a quantified path pattern, there are no node variables declared inside the quantified path pattern that are referenced elsewhere.
 
 | `StatefulShortestPath(Into)`