From PR pkg/43790 by Kamel Derouiche
pkgsrc changes:
- re-set LICENSE (modified-bsd).
upstream changes:
Networkx-1.2
Release date: 28 July 2010
See: https://networkx.lanl.gov/trac/timeline
New features
* Ford-Fulkerson max flow and min cut
* Closness 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 betweeness_centrality for undirected graphs correctly
* Normalize eigenvector_centrality by l2 norm
* read_gml() now returns multigraphs
Based on PR#42834 by Wen Heping.
Update MASTER_SITES, set LICENSE=modified-bsd, 3-caulse BSD.
======================================================================
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 sigificant changes to parts of the graph API to allow graph, node, and edge attributes. See http://networkx.lanl.gov//reference/api_changes.html
* Update Graph, DiGraph, and MultiGraph classes to allow attributes.
* Default edge data is now an empty dictionary (was the integer 1)
* Difference and intersection operators
* Average shortest path
* A* (A-Star) algorithm
* PageRank, HITS, and eigenvector centrality
* Read Pajek files
* Line graphs
* Minimum spanning tree (Kruskal¡Çs algorithm)
* Dense and sparse Fruchterman-Reingold layout
* Random clustered graph generator
* Directed scale-free graph generator
* Faster random regular graph generator
* Improved edge color and label drawing with Matplotlib
* and much more, see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.0
Examples
* Update to work with networkx-1.0 API
* Graph subclass example
======================================================================
Networkx-0.99
Release date: 18 November 2008
See: https://networkx.lanl.gov/trac/timeline
New features¢ù
This release has sigificant changes to parts of the graph API. See http://networkx.lanl.gov//reference/api_changes.html
* Update Graph and DiGraph classes to use weighted graphs as default Change in API for performance and code simplicity.
* New MultiGraph and MultiDiGraph classes (replace XGraph and XDiGraph)
* Update to use Sphinx documentation system http://networkx.lanl.gov/
* Developer site at https://networkx.lanl.gov/trac/
* Experimental LabeledGraph and LabeledDiGraph
* Moved package and file layout to subdirectories.
Bug fixes
* handle root= option to draw_graphviz correctly
Examples
* Update to work with networkx-0.99 API
* Drawing examples now use matplotlib.pyplot interface
* Improved drawings in many examples
* New examples - see http://networkx.lanl.gov/examples/
Pkgsrc changes:
o Change from using extension.mk to egg.mk, on hints from wiz@
o Adjust PLIST so that it matches what is then installed.
o Bump PKGREVISION
