Shortest Path Problems Single Pair Single Source Dijkstra Algorithmus Bellmann-Ford Algorithmus A*-search Single Destination All Pair Floyd-Warshall Algorithmus Johnson → faster on sparse graphs