graph-tool

This version contains bug fixes, improvements to random graph generation, much faster implementation of the spectral module, as well as the complete_graph() and circular_graph() convenience functions. Get it in the download section.

This version contains many bug fixes, includes a new kcore_decomposition function as well as a closeness centrality implementation. Get it in the download section.

This version contains many bug fixes, and switches the underlying graph representation from a boost's adjacency_list to a much simpler, vector-based custom class which uses only about half as much memory. Get it in the download section.

This release contains mainly bug fixes, as well as some improvements to blockmodel inference, and the collection module, as well as a new cookbook section in the documentation about animations.

This release contains several improvements and bug fixes. Highlights include support for blockmodel inference, a collection of useful networks in the new collection module, pie chart vertex shape in graph_draw, several python3 fixes, and many other bug fixes.

This release contains improvements and bug fixes. Highlights include new Katz and HITS centrality algorithms (in centrality), and make_maximal_planar (in topology).

This release contains improvements and bug fixes. Highlights include Python 3 support, and several new functions in the topology module, including tsp_tour() and random_spanning_tree(). This release also fixes issues with the  Clang compiler, which becomes the preferred compiler in MacOS X.

This release contains major improvements and bug fixes. Highlights include a completely new graph_draw() function, which is based on  cairo and GTK+3, has an interactive window, and no longer requires graphviz (the old function is still available as ... [More] graphviz_draw()), implementation of the SFDP mulilevel layout algorithm, and support for reading and writing in  GML format. Get it in the download section. [Less]

This release contains several enhancements and bug fixes, such as a comprehensive improvement of the random_graph() and random_rewire() functions (with the inclusion of blockmodel generation), the implementation of eigenvector centrality and the ... [More] similarity() function. Array access to the property maps of filtered graphs has also been improved with the addition of the fa and ma attributes. Get it in the download section. [Less]

This release includes some bug fixes, improvements to the PageRank code, and an implementation of BGL's Fruchterman-Reingold layout algorithm. Get it in the download section.