hi, sure.. actually i would like to build a kind of report that reflects the amount of paths found for a specific relstype (REL1) between each 2 nodes (actully this means duplicate paths if more than 1 found) , their length, the shortest based on weight, and whether there is at least also one path between the 2 nodes based on teh other relstype (REL2).. so some counting as we go comes into play .. some comparison of sets etc ..
biut i will try 1st myself .. but more in general maybe .. is there a high level methodology or way of working that can be followed to tackle such use cases .in cypher . i.e. make a good generic framework and gather the required info on the go refining the results without loosing the data required to obtain what is needed .. i am aware of my vague question .. lol.. i am always surprised how simple sometimes you can solve queries in cypher if you chaneg your thinking 180 degreees .. ps.. what would really help me maybe to better structure my queries would be some kind of normalized syntax decription for cypher ((e)bnf) .. reg koen 2014-03-23 15:09 GMT+01:00 Tom Zeppenfeldt <[email protected]>: > hard to say without any idea about the far more complex stuff you're > trying to achieve, and the comparisons you'd like to do .. > > -- > 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. > -- Groeten / Best Regards, Koen -- 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.
