I want to find shortest path between node a and e based on available relations between a and next node (here are a,b and c) how can I find shortest path between a and e in w
