Re: Conversion to graph adjacency list

[email protected] Sat, 8 Dec 2018 18:45:13 +0100 (CET)

Newsgroups	gmane.comp.python.scientific.user
Message-ID	<[email protected]>



 
> Have you looked at graph-tool, which is fast?


Yes, I did, cf. the previous post:


> >kruskal_gt           : 1.384

[snip]

> >[gt=Graph-tool]


Graph-tool performs well but I was expecting better timing, it's only 2 times faster than pure Python code where Kruskal is implemented with a basic Union-Find, we are far from genuine C/C++ performance, because usually graph implementations are (about) 20 times faster in C/C++ than pure Python.