cancel
Showing results for 
Search instead for 
Did you mean: 

Head's Up! Site migration is underway. Phase 2: migrate recent content

Most Popular path in graph

prishabh35
Node

How can I select the graph with the maximum value of a relationship property in multiple-hop?

As in the below graph, we have multiple relationships from one node to another with a numeric property, I want to select the highest value's relationship node and hop on to the next node.

 

 

 

graph.png

3 REPLIES 3

Cobra
Ninja
Ninja

Hello @prishabh35 🙂

I don't understand, can you give based on your graph, the expected result?

Regards,
Cobra

prishabh35
Node

Hey @Cobra ,
Thanks for responding!
In simple words, I am looking for the opposite algorithm of the Dijkstra Shortest Path Algorithm. 

In other words, are you looking for the longest way? If yes, then you should read this.