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] <[email protected]> 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>
>
--
> Tiago de Paula Peixoto <[email protected]>
>
>
> ------------------------------
> If you reply to this email, your message will be added to the discussion
> below:
>
http://main-discussion-list-for-the-graph-tool-project.
> 982480.n3.nabble.com/Shortest-distance-complexity-when-used-with-max-dist-
> tp4026018p4026034.html
>
To start a new topic under Main discussion list for the graph-tool
> project, email [email protected]
> To unsubscribe from Shortest_distance complexity when used with max_dist,
> click
> here
> <http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/template/NamlServlet.jtp?macro=unsubscribe_by_code&node=4026018&code=ZnJhbmNvaXMua2F3YWxhQGdtYWlsLmNvbXw0MDI2MDE4fDIxMTQ0MDk4Nzk=>
> .
> NAML
> <http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/template/NamlServlet.jtp?macro=macro_viewer&id=instant_html%21nabble%3Aemail.naml&base=nabble.naml.namespaces.BasicNamespace-nabble.view.web.template.NabbleNamespace-nabble.view.web.template.NodeNamespace&breadcrumbs=notify_subscribers%21nabble%3Aemail.naml-instant_emails%21nabble%3Aemail.naml-send_instant_email%21nabble%3Aemail.naml>
>
--
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-tp4026018p4026035.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
