python-networkx 1.11-1ubuntu3 source package in Ubuntu
Changelog
python-networkx (1.11-1ubuntu3) bionic; urgency=medium
* d/control: Add python(3)-pydotplus to Build-Depends and Suggests
(LP: #1815126).
-- Corey Bryant <email address hidden> Wed, 06 Feb 2019 15:15:38 -0500
Upload details
- Uploaded by:
- Corey Bryant
- Uploaded to:
- Bionic
- Original maintainer:
- Sandro Tosi
- Architectures:
- all
- Section:
- graphics
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Bionic | updates | main | graphics |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| python-networkx_1.11.orig.tar.gz | 1.3 MiB | 0d0e70e10dfb47601cbb3425a00e03e2a2e97477be6f80638fef91d54dd1e4b8 |
| python-networkx_1.11-1ubuntu3.debian.tar.xz | 155.1 KiB | 66a0594e4743dac5895ec80fc032f3400612e7532ce1fd97a95872eb244304d8 |
| python-networkx_1.11-1ubuntu3.dsc | 2.5 KiB | 94ed556055f1153fa56e680ab920518cdf7dc13bff78923d0fde93582187fff2 |
Available diffs
- diff from 1.11-1ubuntu2 to 1.11-1ubuntu3 (755 bytes)
Binary packages built by this source
- python-networkx: tool to create, manipulate and study complex networks
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.
- 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.
