add note explaining last(rel) (#1340)

Author: matea16

pages/advanced-algorithms/deep-path-traversal.mdx

@@ -194,6 +194,10 @@ MATCH path=(n {id: 0})-[* (r, n, p | r.eu_border = false AND n.drinks_USD < 15 A
 RETURN path;
 ```
 
+**Note:** `last(relationships(p))` returns the most recent relationship in the
+current traversal path p, allowing you to filter based on how the current node
+was reached.
+
 ## Breadth-first search
 
 In breadth-first search (BFS) traversal starts from a single node, and the order of
@@ -348,6 +352,10 @@ MATCH path=(n {id: 0})-[*BFS (r, n, p | r.eu_border = false AND n.drinks_USD < 1
 RETURN path;
 ```
 
+**Note:** `last(relationships(p))` returns the most recent relationship in the
+current traversal path p, allowing you to filter based on how the current node
+was reached.
+
 ## Constraining the expansion based on the number of hops
 
 ### Overview
@@ -641,6 +649,10 @@ MATCH path=(n {id: 0})-[*WSHORTEST (r, n | n.total_USD) total_weight (r, n, p, w
 RETURN path, total_weight;
 ```
 
+**Note:** `last(relationships(p))` returns the most recent relationship in the
+current traversal path p, allowing you to filter based on how the current node
+was reached.
+
 ## All shortest paths
 
 Finding all shortest paths is an expansion of the weighted shortest paths problem. The goal
@@ -779,4 +791,8 @@ MATCH path=(n {id: 0})-[*ALLSHORTEST (r, n | n.total_USD) total_weight (r, n, p,
 RETURN path, total_weight;
 ```
 
+**Note:** `last(relationships(p))` returns the most recent relationship in the
+current traversal path p, allowing you to filter based on how the current node
+was reached.
+
 <CommunityLinks/>