Re: [graph-tool] Performance search vs shortest_path

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: https://graph-tool.skewed.de/static/doc/demos/cppextensions/cppextensions.html I saw that you use

Re: [graph-tool] Performance search vs shortest_path

Dear Tiago, Thanks a lot for the prompt answer. I imagined the reason was the c++ implementation. Unfortunately for same case I need to implement a graph with time-dependent weights (e.g. Time Dependent Dijkstra (TDD)), therefore I have to customize the dijkstra search. In case I would like to

Re: [graph-tool] Performance search vs shortest_path

Am 08.02.21 um 20:10 schrieb Alessandro Tonin: First of all, thanks a lot for this amazing library. I have a question about the performance of shortest_path vs dijkstra_search with a custom Visitor. I implemented a very basic example