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

Algorithms changed

Shortest path

astar_path(), astar_path_length(), shortest_path(), shortest_path_length(),

bidirectional_shortest_path(), dijkstra_path(), dijkstra_path_length(),

bidirectional_dijkstra()

These algorithms now raise an exception when a source and a target are specified and no path exist between these two nodes. The exception is a NetworkXNoPath exception.