Apply PR feedback

Author: WilcoNeo

modules/ROOT/pages/functions/predicate.adoc

@@ -110,7 +110,9 @@ RETURN all(i in emptyList WHERE true) as allTrue, all(i in emptyList WHERE false
 |===
 | *Syntax* 3+| `allReduce(accumulator = initial, stepVariable IN list \| reductionFunction, predicate)`
 | *Description* 3+| Returns true if, during the stepwise evaluation of a value across the elements in a given `LIST<ANY>`, the accumulated result satisfies a specified predicate at every step.
-Where that list is a xref:patterns/variable-length-patterns.adoc#group-variables[group variable] defined in a xref:patterns/variable-length-patterns.adoc#quantified-path-patterns[quantified path pattern] (not within a xref:patterns/shortest-paths.adoc[shortest path pattern]), it allows for the early pruning of paths that do not satisfy the predicate.
+Where that list is a xref:patterns/variable-length-patterns.adoc#group-variables[group variable] defined in a xref:patterns/variable-length-patterns.adoc#quantified-path-patterns[quantified path pattern], it allows for the early pruning of paths that do not satisfy the predicate.
+
+*Note*: AllReduce should not be used for a group variable within a xref:patterns/shortest-paths.adoc[shortest path pattern].
 .7+| *Arguments* | *Name* | *Type* | *Description*
 | `accumulator` | `ANY` | A variable that holds the result of the `reductionFunction` as the `list` is iterated.
 It is initialized with the value of `initial`.

modules/ROOT/pages/patterns/variable-length-patterns.adoc

@@ -380,7 +380,7 @@ For example, all relationships in the path must be of type `EMPLOYED_BY`.
 * Nodes or relationships must have properties satisfying some condition.
 For example, all relationships must have the property `distance > 10`.
 
-* For every iteration of the QPP, an aggregated value over the constructed path so far should satisfy a predicate.
+* For every iteration of the quantified path pattern, an aggregated value over the constructed path so far should satisfy a predicate.
 For example, the sum of the property `distance` of the relationships in the path must be less than 50 for every step in the construction of the path.
 See xref::functions/predicate.adoc#functions-allreduce[allReduce] for more information about this predicate.
 
@@ -562,9 +562,8 @@ This query avoids having to find all possible paths and then imposing a `LIMIT 1
 It also shows that there is only one path to solving the query (a number that remains constant even if the data from the rest of the UK railway network was included).
 Using inline predicates or making quantified path patterns more specific where possible can thus greatly improve query performance.
 
-An alternative is to use the information that we want to find paths with a total distance less than `6.05`.
-From the `ALL SHORTEST` query, we know that there exists a path with a total distance of `6.04`.
-Once the path exceeds this limit, we can prune it and continue searching other paths.
+An alternative is to use an upper bound for the total distance, for example `6.05`.
+Once a path exceeds this upper bound, we can prune it and continue searching other paths.
 The xref::functions/predicate.adoc#functions-allreduce[allReduce] predicate function expresses this as follows:
 
 .Query