On 11.02.2018 18:41, Howmahgee wrote: > From trying it on various machines, it seems that it takes around 0.01s for > v.all_neighbors() where v is an arbitrary vertex.
In [2]: %timeit v.all_neighbors() 263 ns ± 1.4 ns per loop (mean ± std. dev. of 7 runs, 1000000 loops each) So, not quite. As usual, without a minimal self-contained example of what you are doing, it is impossible to give any concrete help. Best, Tiago -- Tiago de Paula Peixoto <[email protected]> _______________________________________________ graph-tool mailing list [email protected] https://lists.skewed.de/mailman/listinfo/graph-tool
