python-networkx 1.11~rc1-1ubuntu1 source package in Ubuntu

Changelog

python-networkx (1.11~rc1-1ubuntu1) xenial; urgency=medium

  * Merge with Debian; remaining changes:
    - Don't build the -doc package; too many dependencies in universe.
    - Lower Recommends to Suggests for some universe packages.
  * Build-depend on python3-decorator.

 -- Matthias Klose <email address hidden>  Sun, 17 Jan 2016 11:41:11 +0100

Upload details

Uploaded by:
Matthias Klose
Uploaded to:
Xenial
Original maintainer:
Sandro Tosi
Architectures:
all
Section:
graphics
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Builds

Xenial: [FULLYBUILT] amd64

Downloads

File Size SHA-256 Checksum
python-networkx_1.11~rc1.orig.tar.gz 1.3 MiB 4bd6c71e35079aa65bb1f111dc8b04fd9848ed656b6469062945806f1fdc554c
python-networkx_1.11~rc1-1ubuntu1.debian.tar.xz 155.1 KiB 16749fbd08af6ee5ab6b77552c7c1103d70b28cd889e0d4082da6cd72082cd8d
python-networkx_1.11~rc1-1ubuntu1.dsc 2.4 KiB 90013ab922a88e3a4f80442c373b495b70617791a5521b2be44abbb3b75c89a7

View changes file

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.