Maybe something like this: MATCH p=(s:Checkpoint)-[:PATH*]->(e:Checkpoint) WHERE // filter the s and e checkpoints here, otherwise leave WHERE out RETURN nodes(p) as path, count(*) as c ORDER BY c DESC LIMIT 1
If you give more details maybe we can refine the query... On Thu, May 22, 2014 at 9:35 AM, Navrattan Yadav < navrattan.craterz...@gmail.com> wrote: > i am using Neo4jversion 2.0.3. > > Currently i am working on a project where we need to find out most common > path traversed by user. > > DB : there are some fixed checkpoints. Each checkpoint is a node. > > when user move from one checkpoint to another then i create relation b/w 2 > checkpoints and it is directional . > > Relation name is current_time_username; > > so checkpoint has more relation is most visited. > > now i want to find out most common path b/w 2 checkpoints using Cipher not > using java API. > > i already check Cipher shortestPath function but not work for this. > > -- > 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 neo4j+unsubscr...@googlegroups.com. > For more options, visit https://groups.google.com/d/optout. > -- 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 neo4j+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
