images

Author: JPryce-Aklundh

modules/ROOT/images/different-relationships-graph.svg

@@ -21,45 +21,6 @@ Replacement syntax for deprecated and removed features are also indicated.
 Cypher 25 was introduced in Neo4j 2025.06 and can only be used on Neo4j 2025.06+ databases.
 Features removed in Cypher 25 are still available on Neo4j 2025.06+ databases either by prepending a query with `CYPHER 5` or by having Cypher 5 as the default language for the database.
 
-[[cypher-deprecations-additions-removals-2025.xx]]
-== Neo4j 2025.xx
-
-=== New in Cypher 25
-
-[cols="2", options="header"]
-|===
-| Feature
-| Details
-
-a|
-label:functionality[]
-label:new[]
-[source, cypher, role="noheader"]
-----
-MATCH REPEATABLE ELEMENTS p = (:B)->{,5}()
-RETURN [n IN nodes(p) | n.q] AS nodes
-----
-
-a|
-New match mode, xref:patterns/match-modes.adoc#repeatable-elements[`REPEATABLE ELEMENTS]`.
-This is a non-restrictive match mode, in which relationships matched across all constituent path patterns in a graph patterns can be repeatedly traversed.
-
-|
-label:functionality[]
-label:new[]
-[source, cypher, role="noheader"]
-----
-MATCH DIFFERENT RELATIONSHIPS p = (:B)->{,5}()
-RETURN [n IN nodes(p) | n.q] AS nodes
-----
-
-a|
-New keyword, `DIFFERENT RELATIONSHIPS`, which enables explicitly specifying Cypher's default mode.
-This is a restrictive match mode, which requires that all relationships matched across all constituent path patterns in a graph pattern must be unique.
-Specifying `DIFFERENT RELATIONSHIPS` is functionally equivalent to not specifying a match mode.
-
-|===
-
 [[cypher-deprecations-additions-removals-2025.06]]
 == Neo4j 2025.06
 

modules/ROOT/images/match-modes-graph.svg

@@ -16,6 +16,8 @@ This match mode is required in order for paths to be able to traverse a relation
 
 To explain match modes, this page will use the scenario of the link:https://en.wikipedia.org/wiki/Seven_Bridges_of_K%C3%B6nigsberg[seven bridges of Königsberg], a problem studied by link:https://en.wikipedia.org/wiki/Leonhard_Euler[Leonhard Euler] in 1736 to determine if one could cross all seven bridges of Königsberg exactly once and return to the same starting location.
 
+image::match-modes-graph.svg[Graph showing the seven bridges of Königsberg, width=400, role=popup]
+
 To recreate the graph, run the following query against an empty Neo4j database:
 
 [source, cypher, role=test-setup]
@@ -106,6 +108,8 @@ RETURN pathCount,
 3+d|Rows: 1
 |===
 
+image::different-relationships-graph.svg[Graph showing all but one of the seven bridges of Königsberg traversed, width=500, role=popup]
+_In the `samplePath` with a length of `6` returned by `DIFFERENT RELATIONSHIPS`, all bridges are traversed except for bridge `3`._
 
 However, if the relationship count is increased to `7`, `0` paths are returned.
 
@@ -195,6 +199,9 @@ RETURN [n IN nodes(p) | n.name] AS visitedLocations,
 
 The query now returns solutions, and the order of the bridges traversed in the path returned demonstrates that bridges `2` and `4` were crossed twice in order to return to `Kneiphof`. 
 
+image::repeatable-elements-graph.svg[Several graphs showing order of traversals when using repeatable elements match mode, width=500, role=popup]
+_Sequence of bridge traversals when using `REPEATABLE ELEMENTS`._
+
 For more information about this match mode, see xref:patterns/reference.adoc#match-modes-rules-repeatable-elements[Syntax and semantics -> `REPEATABLE ELEMENTS`].
 
 [[bounded-path-length]]