title: Multi modal graphe algorithm
body: <p>I am creating an application that finds all possible routes a user can take to get from point A to point B using different or specified public transportation modes (e.g. trains, buses, tram, etc). Of course walking edges are permitted. I am using neo4j to store Data, please can you suggest me an algorithm to find the shortest path, i have never worked with multi modal graphs </p>