Hi,
I am writing regarding a shortest path calculation. I hope the solution just have avoided me.
I have some nodes and edges. My all edges contain some properties but there are 2 important.
These are "width" and "distance".
I can use apoc dijkstra route calculation in the simple way and I can use "distance" property.
But couple of days ago I had to add "width" property to the edges.
In this case the simple dijkstra calculation is not good for me longer. Because I should calculate with this property as well.
My first thougt is I should create a subquery. In first step I can remove those edges which contain value 110 of "width" and the returning resultset will be useful for a second query where I can call apoc dijkstra procedure.
But unfortunatelly I can't call dijkstra procedure in a part resultset. It is called always the whole node network I guess because in the returning resultset I can find edges with value 110.
Can you recommend me some solution?
I wouldn't instist dijkstra algorithm if I can use in some other procedure "edge.width > 110" condition with distance weight.
Thank you for your help in advance!
Janos