small fix

Author: JPryce-Aklundh

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

@@ -522,7 +522,7 @@ Each of these operators, and the criteria for their use, is outlined in the xref
 
 For readers not familiar with Cypher execution plans and operators, it is recommended to first read xref:planning-and-tuning/execution-plans.adoc[].
 
-[[example-graph-2]]
+[[example-graph]]
 === Example graph
 
 ////
@@ -539,7 +539,7 @@ In total, the graph consists of almost 90 000 nodes.
 
 Each node (`N`) has a `trail` property that acts as a "breadcrumb" list, tracing the path from the root of the tree to that node (the root node has an empty list for its `trail` property).
 The trail records the choice of `"A"`, `"B"`, or `"C"` taken to reach each node, building a sequence that increases in length with each level.
-This ensures that every trail value is unique in the graph.
+This ensures that every `trail` value is unique in the graph.
 
 To recreate the graph, run the following query against an empty Neo4j database: