As the picture below shows we have nodes with relations but with different labels. how can I find shortest path between node A and node E with condition that relations in th
