File python3-networkx.changes of Package python3-networkx
-------------------------------------------------------------------
Sun May 8 07:03:17 UTC 2016 - arun@gmx.de
- specfile:
* changed to https for source url
* updated source url to files.pythonhosted.org
-------------------------------------------------------------------
Sun Jan 31 00:03:05 UTC 2016 - arun@gmx.de
- specfile:
* update copyright year
- update to version 1.11:
* Release for fixes of installation on some machines, layouts and
docs.
-------------------------------------------------------------------
Mon Aug 10 03:19:32 UTC 2015 - arun@gmx.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 11:09:55 UTC 2015 - toddrme2178@gmail.com
- Fix python3-decorator dependency syntax
-------------------------------------------------------------------
Fri Jan 9 23:54:59 UTC 2015 - arun@gmx.de
- specfile:
* added dependency to python3-decorator
-------------------------------------------------------------------
Mon Jan 5 20:25:59 UTC 2015 - arun@gmx.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 6 13:36:46 UTC 2013 - toddrme2178@gmail.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 14:42:25 UTC 2012 - saschpe@suse.de
- Don't package INSTALL.txt and other docs twice
-------------------------------------------------------------------
Thu Jan 12 14:52:26 UTC 2012 - saschpe@suse.de
- Spec file cosmetics
-------------------------------------------------------------------
Wed Jan 11 14:56:08 UTC 2012 - toddrme2178@gmail.com
- Cleaned up spec file
- Renamed package from python-NetworkX to python-networkx to match the module name
-------------------------------------------------------------------
Thu Sep 8 20:27:43 UTC 2011 - alinm.elena@gmail.com
- initial commit
-------------------------------------------------------------------
Fri Feb 6 00:00:00 UTC 2009 - urs.beyerle@env.ethz.ch
- update to 0.99
-------------------------------------------------------------------
Thu Jun 26 00:00:00 UTC 2008 - ti.eugene@gmail.com
- Initial build
