My goal is to traverse a graph from start to end. 'Next' relationships (with a date property) exist between nodes denoting the order of travel. Would this been a path with only 1 relationship between every 2 nodes, it would be self-explanatory using (start)-[NEXT*]-(end). However, my graph contains cycles and relationships to the node itself, this causes (start)-[NEXT*]-(end) to return all possible paths, whereas I only want the path that contains all the traversals based on the time property containing all the nodes (as sometimes more than 2 relationships exist between two nodes), thus following the 'Next' relationships.
I was thinking about implementing the longest path algorithm with a filter to distinguish between time, but as I am inexperienced, I am looking for some advice.
Your help is much appreciated, thank you.