boostorg/graph — pull request #13 by wygos (2014-07-23 10:55:43+00:00)
Title:     dijkstra_shortest_paths_no_init supports pruning on distances

When the distance map is given and the newly discovered distance
is worse than the distance stored in the distance map,
the vertex is not even added to the priority queue.