I have a path of N nodes like that : (node1)->(node2)->(node3)->()->(nodeN) with the same relationship name. I want to get the list of the nodes in the order of traversal. I'm using nodes(path) function (https://neo4j.com/docs/cypher-manual/current/functions/list/#functions-nodes) and it seems to works, but I can't be sure : in the documentation, there is no information about if the order is guaranteed or not.
The only thing that makes me think that the order is guaranteed is that for the labels() function (List functions - Cypher Manual), it is explicitly indicated that the order is not guaranteed.
Can someone confirm me if the order is guaranteed or not ?