networkx 2.4-4ubuntu1 source package in Ubuntu
Changelog
networkx (2.4-4ubuntu1) groovy; urgency=medium * d/control: Lower Recommends to Suggests for some universe packages. -- Corey Bryant <email address hidden> Tue, 11 Aug 2020 16:41:00 -0400
Upload details
- Uploaded by:
- Corey Bryant
- Uploaded to:
- Groovy
- Original maintainer:
- Ubuntu Developers
- 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.orig.tar.xz | 1.1 MiB | 23a9dfb710f653a07c1d85302da9c10ddc9db153a8e5b8a36101b4e4fc480c09 |
| networkx_2.4-4ubuntu1.debian.tar.xz | 14.8 KiB | d7b63b957b2a16b5afa9f3966457199b4e697b6b34c2cd13ffe8f056c2eddb8e |
| networkx_2.4-4ubuntu1.dsc | 2.6 KiB | 50233377a908ae77dc6020f28c1a8c406db6d93271a05981925cd777d5c4e2a7 |
Available diffs
- diff from 2.4-3ubuntu1 to 2.4-4ubuntu1 (2.2 KiB)
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.
