I'm new to neo4j , so your help is appreciated.
I have a neo4j database with nodes that have a property "Color" and two relationship types, "Previous" and "Next". I have an ArrayList that contains node properties in the order they should be traversed, for example Blue, Red, Yellow.
How do I traverse the graph to find if the exact path Node(Color:Blue) --> Node(Color:Red) --> Node(Color:Yellow) with no nodes in between and all relationships of type "Next", exists in the database?
I'm using neo4j embedded in a java application.