To assess the quality of mobility systems, inconveniences associated with using different modes of transport can be quantified by incorporating travel time equivalents into the actual travel time. This combined value is referred to as travel resistance. Examples of these inconveniences include changing between trains, waiting times, walking distances to stations, and searching for parking spaces when using motorized private transport. This contribution adapts widely recognized shortest path algorithms, such as the Dijkstra or the A* search algorithm to determine the path with the least travel resistance for various modes of transportation.