# python-networkx 1.11-1ubuntu2 source package in Ubuntu

## Changelog

python-networkx (1.11-1ubuntu2) bionic; urgency=medium * python3-networkx: Depend on python3-lib2to3. Closes: #896212. -- Matthias Klose <email address hidden> Thu, 26 Apr 2018 09:39:13 +0200

## Upload details

- Uploaded by:
- Matthias Klose on 2018-04-26

- Uploaded to:
- Bionic

- Original maintainer:
- Sandro Tosi

- Architectures:
- all

- Section:
- graphics

- Urgency:
- Medium Urgency

## See full publishing history Publishing

Series | Published | Component | Section | |
---|---|---|---|---|

Bionic | release | on 2018-04-26 | main | graphics |

## Downloads

File | Size | SHA-256 Checksum |
---|---|---|

python-networkx_1.11.orig.tar.gz | 1.3 MiB | 0d0e70e10dfb47601cbb3425a00e03e2a2e97477be6f80638fef91d54dd1e4b8 |

python-networkx_1.11-1ubuntu2.debian.tar.xz | 155.0 KiB | ed05e1fc7fed0d8c4071afbccab415726da061c42d3ce97d6ab905c64020666a |

python-networkx_1.11-1ubuntu2.dsc | 2.4 KiB | 29f2c25a6c0be98f3d08444b5f6477a491d3632cb6561654133e3101ecdd24be |

### Available diffs

- diff from 1.11-1ubuntu1 to 1.11-1ubuntu2 (472 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.