python-networkx
%description
NetworkX (NX) is a Python package for the creation, manipulation, and study of the structure, dynamics,
and functions of complex networks.
Features:
* Includes standard graph-theoretic and statistical physics functions
* Easy exchange of network algorithms between applications, disciplines, and platforms
* Includes many classic graphs and synthetic networks
* Nodes and edges can be "anything" (e.g. time-series, text, images, XML records)
* Exploits existing code from high-quality legacy software in C, C++, Fortran, etc.
* Open source (encourages community input)
* Unit-tested
- Developed at devel:languages:python:numeric
-
6
derived packages
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Factory/python-networkx && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| networkx-2.6.1.tar.gz | 0001842369 1.76 MB | |
| python-networkx.changes | 0000023529 23 KB | |
| python-networkx.spec | 0000004423 4.32 KB |
Revision 30 (latest revision is 37)
Richard Brown (RBrownSUSE)
accepted
request 909685
from
Dirk Mueller (dirkmueller)
(revision 30)
- require pandas
- update to 2.6.2:
* This release is the result of 11 months of work with over 363 pull requests by
91 contributors. Highlights include:
* Dropped support for Python 3.6.
* NumPy, SciPy, Matplotlib, and pandas are now default requirements.
* NetworkX no longer depends on the library "decorator".
* Improved example gallery
* Removed code for supporting Jython/IronPython
* The __str__ method for graph objects is more informative and concise.
* Improved import time
* Improved test coverage
* New documentation theme
* Add functionality for drawing self-loop edges
* Add approximation algorithms for Traveling Salesman Problem
- drop 0001-Replace-hash-function-for-test-of-weighted-astar.patch,
yaml-loader.patch (merged upstream)
Comments 0