Skip to main content
`Ctrl`+`K`

# NetworkX 1.5

Release date: 4 June 2011

## 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 https://networkx.lanl.gov/trac/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

### Weighted graph algorithms

Many ‘weighted’ graph algorithms now take optional parameter to specify which edge attribute should be used for the weight (default=’weight’) (ticket https://networkx.lanl.gov/trac/ticket/509)

In some cases the parameter name was changed from weighted_edges, or weighted, to weight. Here is how to specify which edge attribute will be used in the algorithms:

- Use weight=None to consider all weights equally (unweighted case)

- Use weight=True or weight=’weight’ to use the ‘weight’ edge attribute

- Use weight=’other’ to use the ‘other’ edge attribute

Algorithms affected are:

betweenness_centrality, closeness_centrality, edge_betweenness_centrality, betweenness_centrality_subset, edge_betweenness_centrality_subset, betweenness_centrality_source, load, closeness_vitality, weiner_index, spectral_bipartivity current_flow_betweenness_centrality, edge_current_flow_betweenness_centrality, current_flow_betweenness_centrality_subset, edge_current_flow_betweenness_centrality_subset, laplacian, normalized_laplacian, adj_matrix, adjacency_spectrum, shortest_path, shortest_path_length, average_shortest_path_length, single_source_dijkstra_path_basic, astar_path, astar_path_length

### Random geometric graph

The random geometric graph generator has been simplified. It no longer supports the create_using, repel, or verbose parameters. An optional pos keyword was added to allow specification of node positions.

## Bug fixes

> - Fix edge handling for multigraphs in networkx/graphviz interface (ticket https://networkx.lanl.gov/trac/ticket/507)

> - Update networkx/pydot interface for new versions of pydot (ticket https://networkx.lanl.gov/trac/ticket/506) (ticket https://networkx.lanl.gov/trac/ticket/535)

> - Fix negative cycle handling in Bellman-Ford (ticket https://networkx.lanl.gov/trac/ticket/502)

> - Write more attributes with GraphML and GML formats (ticket https://networkx.lanl.gov/trac/ticket/480)

> - Handle white space better in read_edgelist (ticket https://networkx.lanl.gov/trac/ticket/513)

> - Better parsing of Pajek format files (ticket https://networkx.lanl.gov/trac/ticket/524) (ticket https://networkx.lanl.gov/trac/ticket/542)

> - Isolates functions work with directed graphs (ticket https://networkx.lanl.gov/trac/ticket/526)

> - Faster conversion to numpy matrices (ticket https://networkx.lanl.gov/trac/ticket/529)

> - Add graph[‘name’] and use properties to access Graph.name (ticket https://networkx.lanl.gov/trac/ticket/544)

> - Topological sort confused None and 0 (ticket https://networkx.lanl.gov/trac/ticket/546)

> - GEXF writer mishandled weight=0 (ticket https://networkx.lanl.gov/trac/ticket/550)

> - Speedup in SciPy version of PageRank (ticket https://networkx.lanl.gov/trac/ticket/554)

> - Numpy PageRank node order incorrect + speedups (ticket https://networkx.lanl.gov/trac/ticket/555)