Stores a map from the vertex id of a landmark to the distance to that landmark.
Computes shortest paths to the given set of landmark vertices.
the edge attribute type (not used in the computation)
the graph for which to compute the shortest paths
the list of landmark vertex ids. Shortest paths will be computed to each landmark.
a graph where each vertex attribute is a map containing the shortest-path distance to each reachable landmark vertex.