search

boostorg / graph

Boost.org graph module
http://boost.org/libs/graph
322 stars 205 forks source link

Dijkstra's shortest paths ignores color_map named parameter #200

Open SamueleDecarli opened 4 years ago

SamueleDecarli commented 4 years ago

Dijsktra's shortest paths takes as parameter UTIL/OUT a color_map. Which should be passed to and used by breadth first search. However, the current implementation ignores the color_map, if provided, and always creates a default one.

https://www.boost.org/doc/libs/1_72_0/libs/graph/doc/dijkstra_shortest_paths.html https://github.com/boostorg/graph/blob/develop/include/boost/graph/dijkstra_shortest_paths.hpp

hdu-sdlzx commented 1 year ago

It seems that UTIL/OUT means "used by the algorithm and you can retrieve its result". An input (IN) argument means initialized values.