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
- Sources inherited from project Cloud:OpenStack:Rocky
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout home:chajain:branches:Cloud:Openstack:Master/python-networkx && cd $_
- Create Badge
Refresh
Refresh
Source Files
Filename | Size | Changed |
---|---|---|
networkx-2.1.zip | 0001612593 1.54 MB | |
python-networkx.changes | 0000015716 15.3 KB | |
python-networkx.spec | 0000003842 3.75 KB |
Latest Revision
Dirk Mueller (dirkmueller)
accepted
request 684723
from
Colleen Murphy (comurphy)
(revision 2)
- specfile: * update copyright year * removed devel from noarch package - update to version 2.1: * Highlights + Arrows for drawing DiGraph edges are vastly improved! And an example to show them. + More than 12 new functions for graph generation, manipulation and/or new graph algorithms. o Add a large clique size heuristic function (#2830) o Add rooted product function (#2825) o Label Propagation Community Detection (#2821) o Minimum cycle basis (#2823) o Add Mycielski Operator (#2785) o Adds prefix_tree, dag_to_branching, and example. (#2784) o Add inverse_line_graph generator from #2241 (#2782) o Steiner tree and metric closure. (#2252) o Add flow based node and edge disjoint paths. (#2063) o Update geometric networks with new models (#2498) o Graph edit distance (#2729) o Added function for finding a k-edge-augmentation (#2572) + G.name is no longer processed by graph operators. It remains as a property mechanism to access G.graph['name'] but the user is in charge of updating or changing it for copies, subgraphs, unions and other graph operations. - specfile: * changes from tar.gz to zip * updated sed * INSTALL doesn't seem to be packaged anymore, deleted "rm" command
Comments 0