Changelog for python3-networkx-1.11-9.6.noarch.rpm :

* Sun May 08 2016 arunAATTgmx.de- specfile:
* changed to https for source url
* updated source url to files.pythonhosted.org
* Sun Jan 31 2016 arunAATTgmx.de- specfile:
* update copyright year- update to version 1.11:
* Release for fixes of installation on some machines, layouts and docs.
* Mon Aug 10 2015 arunAATTgmx.de- update to version 1.10:
* long list of changes, see http://networkx.readthedocs.org/en/stable/reference/api_1.10.html
* Thu Feb 26 2015 toddrme2178AATTgmail.com- Fix python3-decorator dependency syntax
* Fri Jan 09 2015 arunAATTgmx.de- specfile:
* added dependency to python3-decorator
* Mon Jan 05 2015 arunAATTgmx.de- specfile:
* update copyright year
* add setuptools- update to version 1.9.1:
* Completely rewritten maximum flow and flow-based connectivity algorithms with backwards incompatible interfaces
* Community graph generators
* Stoer–Wagner minimum cut algorithm
* Linear-time Eulerian circuit algorithm
* Linear algebra package changed to use SciPy sparse matrices
* Algebraic connectivity, Fiedler vector, spectral ordering algorithms
* Link prediction algorithms
* Goldberg–Radzik shortest path algorithm
* Semiconnected graph and tree recognition algorithms
* API changes See Version 1.9 notes and API changes. http://networkx.github.io/documentation/networkx-1.9.1/reference/api_1.9.html
* Fri Dec 06 2013 toddrme2178AATTgmail.com- Update to 1.8.1
* Bugfixes- Update to 1.8
* Faster (linear-time) graphicality tests and Havel-Hakimi graph generators
* Directed Laplacian matrix generator
* Katz centrality algorithm
* Functions to generate all simple paths
* Improved shapefile reader
* More flexible weighted projection of bipartite graphs
* Faster topological sort, decendents and ancestors of DAGs
* Scaling parameter for force-directed layout- Update to 1.7
* 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.- Add optional dependencies as Recommends- Add python 3 version
* Tue Jan 31 2012 saschpeAATTsuse.de- Don\'t package INSTALL.txt and other docs twice
* Thu Jan 12 2012 saschpeAATTsuse.de- Spec file cosmetics
* Wed Jan 11 2012 toddrme2178AATTgmail.com- Cleaned up spec file- Renamed package from python-NetworkX to python-networkx to match the module name
* Thu Sep 08 2011 alinm.elenaAATTgmail.com- initial commit