Im modeling a graph where nodes are places and edges indicate that you can go from one place to another.
This is to have all routes that you can take from a place to another, and you can go from a place to another by different routes, so I want a query that retus me the shortest path with the minimum different routes.
For example, I want to go from A to D, I have two possible paths:
(place {name: "A"})-[:FOLLOWS{route:""R1}]->(place{name: "B" })-[:FOLLOWS{route:""R4}]->(place{name:"C"})-[:FOLLOWS{route:""R2}]->(place{name:"D"})
(place {name: "A"})-[:FOLLOWS{route:""R1}]->(place{name: "B" })-[:FOLLOWS{route:""R1}]->(place{name:"F"})-[:FOLLOWS{route:""R2}]->(place{name:"D"})
In the previous two path, both are the same size, but I would like to get the second one, which is the one who has the minimum route changes.
Thank you.