Skip to content

Commit 33a7adf

Browse files
fix
1 parent 1055067 commit 33a7adf

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

modules/ROOT/pages/patterns/shortest-paths.adoc

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -159,14 +159,14 @@ If there had been only four possible paths between the two Stations, then only t
159159
To return all paths that are tied for shortest length, use the keywords `ALL SHORTEST`:
160160

161161
.Query
162-
// tag::patterns_shortest_paths_shortest_k[]
162+
// tag::patterns_shortest_paths_all_shortest[]
163163
[source,cypher]
164164
----
165165
MATCH p = ALL SHORTEST (wos:Station)-[:LINK]-+(bmv:Station)
166166
WHERE wos.name = "Worcester Shrub Hill" AND bmv.name = "Bromsgrove"
167167
RETURN [n in nodes(p) | n.name] AS stops
168168
----
169-
// end::patterns_shortest_paths_shortest_k[]
169+
// end::patterns_shortest_paths_all_shortest[]
170170

171171
.Result
172172
[role="queryresult",options="header,footer",cols="m"]

0 commit comments

Comments
 (0)