I am exploring neo4j for a POC.
I went over some reading material and training videos.
I have a requirement that I was hoping someone would be able to help out with.
Graph nodes are connected with directed relationships. There can be multiple types of relationships.
I need to find out if there is a path from Node A to Node B such that each relationship traversed has type X (say Friend) and has a status (active or pending).
Can this be done using the existing graph algorithm? What are my options?
New to neo4j, any help is greatly appreciated 