This sounds like a great news, i wasn't expecting this news so early. Just one question: i see that most of the most important algorithms (at least for me) are already there. What about shortest paths (Dijkstra and Floyd-Warshall i.e.)? Is it missing in the doc or you plan them for the future? Congratulations again for your great work. Claudio On Mon, Oct 5, 2009 at 5:45 PM, Tiago de Paula Peixoto <tiago@forked.de> wrote:
I'm happy to announce version 2.0.0 from graph-tool!
What is new? ============
Python module -------------
It is the first stable release since years ago, and marks a full transition of graph-tool from a stand-alone program to a full python module. It is pointless to summarize all the differences, since everything changed. The new version is, for me, a lot more comfortable to work with, and the internals are a lot cleaner. Everything integrates nicely with scipy/numpy, and I hope graph-tool will be a nice addition to this framework.
More algorithms ----------------
The number of algorithms has increased significantly. Now there is support for maximum flow, pagerank, motifs, isomorphism, and many more. Most algorithms in the Boost Graph Library are now available in graph-tool.
Documentation -------------
This version includes full documentation, with code examples, available online and from the docstrings. The documentation has 100% coverage of every function and data structure.
Read it in all its glory at: https://projects.forked.de/graph-tool/doc/
Bug fixes =========
Several. Just dig into the git archive to see the gory details: http://git.forked.de/?p=graph-tool
Where to get ============
Get it from the usual place:
https://projects.forked.de/graph-tool/wiki/GraphToolDownload Packages! ---------
Pre-build packages are also available for Debian and Ubuntu, for those who don't want (or can't) compile everything from source.
Best regards, and enjoy!
Tiago
_______________________________________________ graph-tool mailing list graph-tool@forked.de http://lists.forked.de/mailman/listinfo/graph-tool
-- Claudio Martella claudio.martella@gmail.com