graph-tool

Download

graph-tool@skewed.de

March 2015

12 participants
22 discussions

Biconnected components and all paths between two vertices of an unoriented multigraph
by atn 06 Mar '15

06 Mar '15

Hi, I’m looking for a dll with good documentation that I will call from C#/.Net in order to: 1. generate the biconnected components of an unoriented (multi)graph (i.e. possible loops and parallel edges); 2. generate the list of (simple) paths between two given vertices of an unoriented (multi)graph. The main requirements I have are: i) “good” dll documentation with examples; ii) performance comparable to C++; iii) the dll is reliable, i.e. it has been sufficiently benchmarked and tested; iv) support: if bugs in the dll are found, then they can be dealt with in a reasonable time; v) licensing agreement which gives me the possibility to use this dll inside code that I may deploy for a non-profit organization. Does graph-tool fit these requirement ? Are there consulting/commercial codes which may fit these requirements ? Thanks in advance for your help. -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com… Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.

1 0

Networkx VS graph-tool
by mohsenuss91 01 Mar '15

01 Mar '15

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… Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.

2 2