NEO4J shortestPath taking into account a particular relationship pattern -


i have graph have chains of nodes have relationship [:links_to] , can shortestpath function work.

for of users level of detail fine.

i have set of users there need richer set of information on relationship. given properties on relationships supposed represent strengths or scores relationship have created specific nodes hold descriptive metadata.

this means have pattern says (start)-[:participates]-(middle)-[:references]->(end)

there can number of nodes between start , end points in chain.

i struggling shortestpath function return results more detailed chain. there way using cypher?

you have kept metadata information on relationships.

for needs, should work:

match p = shortestpath((start)-[:participates|:references*]->(end)) return nodes(p) 

Comments

Popular posts from this blog

database - VFP Grid + SQL server 2008 - grid not showing correctly -

jquery - Set jPicker field to empty value -

.htaccess - htaccess convert request to clean url and add slash at the end of the url -