Most Popular path in graph

[prishabh35]

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.

[Cobra]

Hello @prishabh35 🙂

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

Regards,
Cobra

[prishabh35]

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

[Cobra]

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