I have a network, in this an user can be connected in any pattern as shown
below.
*(u:user{guid:123})*<-[r]-(mg)<-[r2]-(c)
*(**u:user{guid:123}**)*<-[r]-(mg)<-[r2]-(c)<-[r3]-(mg2)<-[r4]-(c2)
*(**u:user{guid:123}**)*
<-[r]-(mg)<-[r2]-(c)-[r3]->(mg2)-[r4]->(c2)<-[r5]-(mg3)<-[r6]-(c3)
*(**u:user{guid:123}**)*
<-[r]-(mg)<-[r2]-(c)-[r3]->(mg2)-[r4]->(c2)<-[r5]-(mg3)<-[r6]-(c3)<-[r7]-(mg4)<-[r8]-(c4)
'u' is an user with a GUID.
There are multiple pattern of connection between two user.
I want to list all possible paths between two users given their GUIDs.
Please give some hints to achieve this.
Thank you.
--
You received this message because you are subscribed to the Google Groups
"Neo4j" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/d/optout.
