python-networkx 1.5-2 source package in Ubuntu
Changelog
python-networkx (1.5-2) unstable; urgency=low * debian/patches/40_astar_unique_shortest_path.diff - make A* shortest paths unique; Closes: #634083 -- Sandro Tosi <email address hidden> Sun, 17 Jul 2011 13:53:32 +0200
Upload details
- Uploaded by:
- Debian Python Modules Team
- Uploaded to:
- Sid
- Original maintainer:
- Debian Python Modules Team
- Architectures:
- all
- Section:
- python
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| python-networkx_1.5-2.dsc | 1.6 KiB | 10aa96bc79c8e18ea4379120ec016a8a1371f11d8f3dca1301fa6132c279c11e |
| python-networkx_1.5.orig.tar.gz | 643.2 KiB | 3985f25e0bb830f5e3ab088bfd28ee46ed549105d845ee55fffc40d41940cedd |
| python-networkx_1.5-2.debian.tar.gz | 158.5 KiB | 40b709d0f8bbcd57bba449b34f47357a1f9b4c32ddb8ab726c02edf7a89b96d0 |
No changes file available.
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.
- 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.
