Release Log¶

Networkx-1.7¶

Release date: 4 July 2012

Highlights¶

New functions for k-clique community finding, flow hierarchy, union, disjoint union, compose, and intersection operators that work on lists of graphs, and creating the biadjacency matrix of a bipartite graph.
New approximation algorithms for dominating set, edge dominating set, independent set, max clique, and min-weighted vertex cover.
Many bug fixes and other improvements.

For full details of the tickets closed for this release (added features and bug fixes) see: https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.7

API Changes¶

See Version 1.7 notes and API changes

Networkx-1.6¶

Release date: 20 November 2011

Highlights¶

New functions for finding articulation points, generating random bipartite graphs, constructing adjacency matrix representations, forming graph products, computing assortativity coefficients, measuring subgraph centrality and communicability, finding k-clique communities, and writing JSON format output.

New examples for drawing with D3 Javascript library, and ordering matrices with the Cuthill-McKee algorithm.

More memory efficient implementation of current-flow betweenness and new approximation algorithms for current-flow betweenness and shortest-path betweenness.

Simplified handling of “weight” attributes for algorithms that use weights/costs/values. See Version 1.6 notes and API changes.

Updated all code to work with the PyPy Python implementation pypy.org which produces faster performance on many algorithms.

For full details of the tickets closed for this release (added features and bug fixes) see: https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.6

API Changes¶

See Version 1.6 notes and API changes

Networkx-1.5¶

Release date: 4 June 2011

For full details of the tickets closed for this release see: https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.5

Highlights¶

New features¶

Algorithms for generating and analyzing bipartite graphs

Maximal independent set algorithm

Erdős-Gallai graphical degree sequence test

Negative edge cycle test

More memory efficient Dijkstra path length with cutoff parameter

Weighted clustering coefficient

Read and write version 1.2 of GEXF reader format

Neighbor degree correlation that handle subsets of nodes

In-place node relabeling

Many ‘weighted’ graph algorithms now take optional parameter to use specified edge attribute (default=’weight’) (ticket 509)

Test for distance regular graphs

Fast directed Erdős-Renyi graph generator

Fast expected degree graph generator

Navigable small world generator

Waxman model generator

Geographical threshold graph generator

Karate Club, Florentine Families, and Davis' Women's Club graphs

API Changes¶

See Version 1.5 notes and API changes

Bug fixes¶

Fix edge handling for multigraphs in networkx/graphviz interface (ticket 507)

Update networkx/pydot interface for new versions of pydot (ticket 506), (ticket 535)

Fix negative cycle handling in Bellman-Ford (ticket 502)

Write more attributes with GraphML and GML formats (ticket 480)

Handle white space better in read_edgelist (ticket 513)

Better parsing of Pajek format files (ticket 524) (ticket 542)

Isolates functions work with directed graphs (ticket 526)

Faster conversion to numpy matrices (ticket 529)

Add graph[‘name’] and use properties to access Graph.name (ticket 544)

Topological sort confused None and 0 (ticket 546)

GEXF writer mishandled weight=0 (ticket 550)

Speedup in SciPy version of PageRank (ticket 554)

Numpy PageRank node order incorrect + speedups (ticket 555)

Networkx-1.4¶

Release date: 23 January 2011

New features¶

k-shell,k-crust,k-corona

read GraphML files from yEd

read/write GEXF format files

find cycles in a directed graph

DFS and BFS algorithms

chordal graph functions

Prim's algorithm for minimum spanning tree

r-ary tree generator

rich club coefficient

NumPy matrix version of Floyd's algorithm for all-pairs shortest path

read GIS shapefiles

functions to get and set node and edge attributes

and more, see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.4

API Changes¶

gnp_random_graph() now takes a directed=True|False keyword instead of create_using

gnm_random_graph() now takes a directed=True|False keyword instead of create_using

Bug fixes¶

see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.4

Networkx-1.3¶

Release date: 28 August 2010

See: https://networkx.lanl.gov/trac/timeline

New features¶

Works with Python versions 2.6, 2.7, 3.1, and 3.2 (but not 2.4 and 2.5).

Minimum cost flow algorithms

Bellman-Ford shortest paths

GraphML reader and writer

More exception/error types

Updated many tests to unittest style. Run with: “import networkx; networkx.test()” (requires nose testing package)

and more, see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.3

API Changes¶

minimum_spanning_tree() now returns a NetworkX Graph (a tree or forest)

Bug fixes¶

see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.3

Networkx-1.2¶

Release date: 28 July 2010

See: https://networkx.lanl.gov/trac/timeline

New features¶

Ford-Fulkerson max flow and min cut

Closeness vitality

Eulerian circuits

Functions for isolates

Simpler s_max generator

Compatible with IronPython-2.6

Improved testing functionality: import networkx; networkx.test() tests entire package and skips tests with missing optional packages

All tests work with Python-2.4

and more, see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.2

Networkx-1.1¶

Release date: 21 April 2010

See: https://networkx.lanl.gov/trac/timeline

New features¶

Algorithm for finding a basis for graph cycles

Blockmodeling

Assortativity and mixing matrices

in-degree and out-degree centrality

Attracting components and condensation.

Weakly connected components

Simpler interface to shortest path algorithms

Edgelist format to read and write data with attributes

Attribute matrices

GML reader for nested attributes

Current-flow (random walk) betweenness and closeness.

Directed configuration model, and directed random graph model.

Improved documentation of drawing, shortest paths, and other algorithms

Many more tests, can be run with “import networkx; networkx.test()”

and much more, see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.1

API Changes¶

Returning dictionaries¶

Several of the algorithms and the degree() method now return dictionaries keyed by node instead of lists. In some cases there was a with_labels keyword which is no longer necessary. For example,

>>> G=nx.Graph()
>>> G.add_edge('a','b')
>>> G.degree() # returns dictionary of degree keyed by node
{'a': 1, 'b': 1}

Asking for the degree of a single node still returns a single number

>>> G.degree('a')
1

The following now return dictionaries by default (instead of lists) and the with_labels keyword has been removed:

Graph.degree(), MultiGraph.degree(), DiGraph.degree(), DiGraph.in_degree(), DiGraph.out_degree(), MultiDiGraph.degree(), MultiDiGraph.in_degree(), MultiDiGraph.out_degree().

clustering(), triangles()

node_clique_number(), number_of_cliques(), cliques_containing_node()

eccentricity()

The following now return dictionaries by default (instead of lists)

pagerank()

hits()

Adding nodes¶

add_nodes_from now accepts (node,attrdict) two-tuples

>>> G=nx.Graph()
>>> G.add_nodes_from([(1,{'color':'red'})])

Examples¶

Mayvi2 drawing

Blockmodel

Sampson’s monastery

Ego graph

Bug fixes¶

Support graph attributes with union, intersection, and other graph operations

Improve subgraph speed (and related algorithms such as connected_components_subgraphs())

Handle multigraphs in more operators (e.g. union)

Handle double-quoted labels with pydot

Normalize betweenness_centrality for undirected graphs correctly

Normalize eigenvector_centrality by l2 norm

read_gml() now returns multigraphs

Networkx-1.0.1¶

Release date: 11 Jan 2010

See: https://networkx.lanl.gov/trac/timeline

Bug fix release for missing setup.py in manifest.

Networkx-1.0¶

Release date: 8 Jan 2010

See: https://networkx.lanl.gov/trac/timeline

New features¶

This release has significant changes to parts of the graph API to allow graph, node, and edge attributes. See networkx.lanl.gov//reference/api_changes.ht

Navigation

Table Of Contents

Previous topic

Next topic

Release Log¶

Networkx-1.7¶

Highlights¶

API Changes¶

Networkx-1.6¶

Highlights¶

API Changes¶

Networkx-1.5¶

Highlights¶

New features¶

API Changes¶

Bug fixes¶

Networkx-1.4¶

New features¶

API Changes¶

Bug fixes¶

Networkx-1.3¶

New features¶

API Changes¶

Bug fixes¶

Networkx-1.2¶

New features¶

Networkx-1.1¶

New features¶

API Changes¶

Returning dictionaries¶

Adding nodes¶

Examples¶

Bug fixes¶

Networkx-1.0.1¶

Networkx-1.0¶

New features¶

Navigation

Table Of Contents

Previous topic

Next topic

Quick search

Release Log¶

Networkx-1.7¶

Highlights¶

API Changes¶

Networkx-1.6¶

Highlights¶

API Changes¶

Networkx-1.5¶

Highlights¶

New features¶

API Changes¶

Bug fixes¶

Networkx-1.4¶

New features¶

API Changes¶

Bug fixes¶

Networkx-1.3¶

New features¶

API Changes¶

Bug fixes¶

Networkx-1.2¶

New features¶

Networkx-1.1¶

New features¶

API Changes¶

Returning dictionaries¶

Adding nodes¶

Examples¶

Bug fixes¶

Networkx-1.0.1¶

Networkx-1.0¶

New features¶