Hi, I'm new to neo4j and don't know what this problem is called as. So posting here without much exploration of previous posts.
I'm modeling data in graph but the combination of edges in paths become significant. How to model in such scenario? for example, create (node1) ,(node2) ,(node3) ,(node4) ,(node5) ,(node6) ,(node7) ,(node1)-[:precedes]->(node5) ,(node2)-[:precedes]->(node5) ,(node3)-[:precedes]->(node5) ,(node4)-[:precedes]->(node5) ,(node5)-[:precedes]->(node6) ,(node5)-[:precedes]->(node7) when I try to find out list of all paths I'll get total 8 paths. But for my data, only few paths are significant and that should be my output. ie. only 4 paths should be in output because data (of nodes) has dependencies. (node1)-[:precedes]->(node5)-[:precedes]->(node6) (node3)-[:precedes]->(node5)-[:precedes]->(node6) (node3)-[:precedes]->(node5)-[:precedes]->(node7) (node4)-[:precedes]->(node5)-[:precedes]->(node7) whereas path like (node1)-[:precedes]->(node5)-[:precedes]->(node7) is invalid combination. Question is how to model such cases so that I always get proper combination of edges. Thanks, Rasik -- 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.
