Sorry, I don't want to ignore you but I don't think I'll get around to upgrading any time soon. Should be easy enough for anyone to check for themselves though. Glad it's getting better though. The edge iterator isn't near as bad slow as generating some other objects I've been working with (gdal.OGRGeometry for instance). Thanks, Elliot On Wed, Aug 6, 2014 at 5:33 PM, Tiago de Paula Peixoto <tiago@skewed.de> wrote:
On 06.08.2014 21:02, ... wrote:
If you're just looping through once, it makes sense to use the convenience graph_tool provides. But if you are implementing a graph algorithm, just grab what you need from the graph_tool graph into a list or whatever python object makes sense for what you're doing.
Could you try those examples again with the newest version in git? I've made some changes which should make the loops slightly faster.
However nothing is going to beat iterating through a list of edges, since using the Graph.edges() iterator will include all the time necessary for the creation of the edge descriptors.
Best, Tiago
-- Tiago de Paula Peixoto <tiago@skewed.de>
_______________________________________________ graph-tool mailing list graph-tool@skewed.de http://lists.skewed.de/mailman/listinfo/graph-tool