Re: [graph-tool] Shortest_distance complexity when used with max_dist

On 06.03.2015 19:15, François wrote:

...

With only two points it is not possible to distinguish between O(V), O(V log V), O(V ^ 2) or anything else.

Of course I wouldn't generalize from this example. But I can't explain myself why the execution time differs so much between the sub-sample and the full graph. I choose the same source-vertex. The graph around this source is the same in the sub-sample and the full graph.

I'm not sure I understand exactly what the problem is. Could you explain in detail exactly what you are doing, and why you the think the performance is unexpected?

Best, Tiago