Tiago Peixoto wrote > It does not really change the (worst-time) complexity per se, but it > should run faster, since the search is stopped sooner. If max_dist is > much smaller than typical distances, it can indeed be much faster.
Yes, this situation I deal with. Tiago Peixoto 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. Best, François. -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/Shortest-distance-complexity-when-used-with-max-dist-tp4026018p4026023.html Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com. _______________________________________________ graph-tool mailing list [email protected] http://lists.skewed.de/mailman/listinfo/graph-tool
