[graph-tool] Performance search vs shortest_path
Tiago de Paula Peixoto
tiago at skewed.de
Tue Feb 9 13:08:34 CET 2021
Am 09.02.21 um 12:53 schrieb Alessandro Tonin:
> In case I would like to write a c++ extension, which steps do you suggest me
> to take?
Read the documentation:
> I saw that you use dijkstra_shortest_paths_no_color_map_no_init from boost
> library with the class djk_max_visitor. Do you think I can just extend the
> class adding the examine_edge method?
Sure, why not...
Tiago de Paula Peixoto <tiago at skewed.de>
More information about the graph-tool