Done. Thank you. Do you know how long it may take until this function appears? I have no idea how complex it is to implement or how many other projects may be pending so excuse the potentially naïve question.
-----Original Message----- From: graph-tool [mailto:[email protected]] On Behalf Of Tiago de Paula Peixoto Sent: 09 March 2016 22:48 To: [email protected] Subject: Re: [graph-tool] How is all_shortest_paths defined? On 09.03.2016 23:39, Philipp-Maximilian Jacob wrote: > I realise that returning all paths connecting two nodes may lead to > combinatorial explosion in some cases but is it possible to get > graph-tool to return all paths up to a certain length? A function that returns all paths is not yet implemented, but is planned. Please open a feature-request issue in the website to help speed it up. Best, Tiago -- Tiago de Paula Peixoto <[email protected]> _______________________________________________ graph-tool mailing list [email protected] http://lists.skewed.de/mailman/listinfo/graph-tool
