Hello,
I've time the shortest_distance on one hundred nodes in both graph, with the graph_tool.openmp_set_num_threads(1). The results are comparable to my previous measures, with 11ms in avg. for the small graph and 320ms in avg. for the full graph.
Best, f
Le mar. 10 mars 2015 à 21:17, Tiago Peixoto [via Main discussion list for the graph-tool project] ml-node+s982480n4026034h11@n3.nabble.com a écrit :
On 10.03.2015 16:55, François wrote:
Does the libgraph_tool_topology.get_*dists *could suffer from the same problems of memory re-allocations ? If not, what could be the reasons of the execution time increase (approx. 23x) observed for libgraph_tool_topology.get_*dists *?
No, the vectors are allocated before the function is called. I would rather wait for you to try without openmp to be sure it is not interfering.
Best, Tiago
--
Tiago de Paula Peixoto <[hidden email]
http:///user/SendEmail.jtp?type=node&node=4026034&i=0>
graph-tool mailing list [hidden email] http:///user/SendEmail.jtp?type=node&node=4026034&i=1 http://lists.skewed.de/mailman/listinfo/graph-tool
*signature.asc* (836 bytes) Download Attachment http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/attachment/4026034/0/signature.asc