Hi, I'm working on graph mining, so I'm trying to find the best library to do
that.
I read in http://graph-tool.skewed.de/performance that "graph-tool" is
faster, so I tried the same program who count the duplicated graphs (I call
them frequent in the program) in networkx and graph-tool.
graph are in this .txt file ==> http://pastebin.com/u5BUxx2p
networkx program ==> http://pastebin.com/FPRy7Ywv
graph-tool program ==> http://pastebin.com/dK93x6tf
there are the results:
* Networkx:
RUNNING TIME: 0.00204300880432s
Reading from file: 0.000211000442505s
Algo: 0.00186109542847s
*************
graph-tool:
RUNNING TIME: 0.0780489444733s
Reading from file: 0.00203204154968s
Algo: 0.0760469436646s*
___________________________
I 'm not sure if my graph-tool program need amelioration or that is the best
performance ?
--
View this message in context:
http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/Networkx-VS-graph-tool-tp4026013.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
