[graph-tool] Performance search vs shortest_path

Alessandro Tonin tonin.ale at gmail.com
Mon Feb 8 20:10:10 CET 2021

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
<https://nabble.skewed.de/file/t496286/basic_example.py>   with a Visitor
with just the method 

Using a graph of approx. 60k edges and 60k vertices, the performance of
dijkstra_search are 30 times slower than the default method shortest_path.

Is this difference normal, or I am doing some error in the code?



Sent from: https://nabble.skewed.de/

More information about the graph-tool mailing list