CVS commit: pkgsrc/math/py-networkx

["OBATA Akio" <obache%netbsd.org@localhost>]

Module Name:    pkgsrc
Committed By:   obache
Date:           Sat Jun  2 13:19:17 UTC 2012

Modified Files:
        pkgsrc/math/py-networkx: Makefile PLIST distinfo

Log Message:
Update py-networkx to 1.6.
Based on PR 46506 by Wen Heping.
* let to register egg-info.
* marked as incompatible with python 2.5, as new features in 1.3.
  but not marked as compatible with 3.x, one file will not be compiled well
  both 3.1 and 3.2.

Lease Log:

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 http://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:
        http://networkx.lanl.gov/reference/api_1.6.html

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
        http://networkx.lanl.gov/reference/api_1.5.html

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


To generate a diff of this commit:
cvs rdiff -u -r1.5 -r1.6 pkgsrc/math/py-networkx/Makefile
cvs rdiff -u -r1.6 -r1.7 pkgsrc/math/py-networkx/PLIST
cvs rdiff -u -r1.3 -r1.4 pkgsrc/math/py-networkx/distinfo

Please note that diffs are not public domain; they are subject to the
copyright notices on the relevant files.