networkx 2.4-3 source package in Ubuntu
Changelog
networkx (2.4-3) unstable; urgency=medium
* debian/control
- add Breaks on current buster versions of androguard and hyperkitty, as
they require updates for the new networkx; Closes: #947852
-- Sandro Tosi <email address hidden> Tue, 31 Dec 2019 19:19:41 -0500
Upload details
- Uploaded by:
- Sandro Tosi
- Uploaded to:
- Sid
- Original maintainer:
- Sandro Tosi
- Architectures:
- all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| networkx_2.4-3.dsc | 2.5 KiB | 66b63ed0ccdc2320152fd9850574848fe7cc33a5cab1b486699e0d3a516d42c1 |
| networkx_2.4.orig.tar.xz | 1.1 MiB | 23a9dfb710f653a07c1d85302da9c10ddc9db153a8e5b8a36101b4e4fc480c09 |
| networkx_2.4-3.debian.tar.xz | 14.6 KiB | 42613f7fd38b71a34043e539bde56db1ebb285f7770595240462c1dba14db1a7 |
Available diffs
- diff from 2.4-2 to 2.4-3 (557 bytes)
No changes file available.
Binary packages built by this source
- python-networkx-doc: tool to create, manipulate and study complex networks - documentation
NetworkX is a Python-based package for the creation, manipulation, and
study of the structure, dynamics, and functions of complex networks.
.
The structure of a graph or network is encoded in the edges (connections,
links, ties, arcs, bonds) between nodes (vertices, sites, actors). If
unqualified, by graph it's meant a simple undirected graph, i.e. no
self-loops and no multiple edges are allowed. By a network it's usually
meant a graph with weights (fields, properties) on nodes and/or edges.
.
The potential audience for NetworkX includes: mathematicians, physicists,
biologists, computer scientists, social scientists.
.
This package contains documentation for NetworkX.
- python3-networkx: tool to create, manipulate and study complex networks (Python3)
NetworkX is a Python-based package for the creation, manipulation, and
study of the structure, dynamics, and functions of complex networks.
.
The structure of a graph or network is encoded in the edges (connections,
links, ties, arcs, bonds) between nodes (vertices, sites, actors). If
unqualified, by graph it's meant a simple undirected graph, i.e. no
self-loops and no multiple edges are allowed. By a network it's usually
meant a graph with weights (fields, properties) on nodes and/or edges.
.
The potential audience for NetworkX includes: mathematicians, physicists,
biologists, computer scientists, social scientists.
.
This package contains the Python 3 version of NetworkX.
