Hello people, Does anyone know an efficient c++ implementation of shortest paths algorithms for large graphs (like the ones obtained by considering images as graph, which result in numerous vertices and edges)? I'm interested in the Floyd Warshall algorithm as well as the Dijkstra's one. Tim