1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
|
Source: python-graph
Section: python
Priority: optional
Maintainer: Sandro Tosi <morph@debian.org>
Uploaders: Debian Python Modules Team <python-modules-team@lists.alioth.debian.org>
Build-Depends: debhelper (>= 9), dh-python
Build-Depends-Indep: python-all (>= 2.5.3-1~), python3-all, python-epydoc, python-setuptools, python-pydot, python3-setuptools, python3-pydot
Standards-Version: 3.9.6
Homepage: http://code.google.com/p/python-graph/
Vcs-Svn: svn://anonscm.debian.org/python-modules/packages/python-graph/trunk/
Vcs-Browser: http://anonscm.debian.org/viewvc/python-modules/packages/python-graph/trunk/
X-Python-Version: all
X-Python3-Version: all
Package: python-pygraph
Architecture: all
Depends: ${python:Depends}, ${misc:Depends}, python-pydot, python-pkg-resources
Suggests: libgv-python, python-pyparsing
Description: library for working with graphs in Python
This software provides a suitable data structure for representing graphs and a
whole set of important algorithms.
.
Provided features and algorithms:
.
* Support for directed, undirected, weighted and non-weighted graphs
* Support for hypergraphs
* Canonical operations
* XML import and export
* DOT-Language output (for usage with Graphviz)
* Random graph generation
.
* Accessibility (transitive closure)
* Breadth-first search
* Critical path algorithm
* Cut-vertex and cut-edge identification
* Cycle detection
* Depth-first search
* Heuristic search (A* algorithm)
* Identification of connected components
* Minimum spanning tree (Prim's algorithm)
* Mutual-accessibility (strongly connected components)
* Shortest path search (Dijkstra's algorithm)
* Topological sorting
* Transitive edge identification
Package: python3-pygraph
Architecture: all
Depends: ${python3:Depends}, ${misc:Depends}, python3-pkg-resources
#Depends: python-pydot
Suggests: python3-pyparsing
#Suggests: libgv-python,
Description: library for working with graphs in Python (Python3)
This software provides a suitable data structure for representing graphs and a
whole set of important algorithms.
.
Provided features and algorithms:
.
* Support for directed, undirected, weighted and non-weighted graphs
* Support for hypergraphs
* Canonical operations
* XML import and export
* DOT-Language output (for usage with Graphviz)
* Random graph generation
.
* Accessibility (transitive closure)
* Breadth-first search
* Critical path algorithm
* Cut-vertex and cut-edge identification
* Cycle detection
* Depth-first search
* Heuristic search (A* algorithm)
* Identification of connected components
* Minimum spanning tree (Prim's algorithm)
* Mutual-accessibility (strongly connected components)
* Shortest path search (Dijkstra's algorithm)
* Topological sorting
* Transitive edge identification
.
This package contains the Python 3 version of pygraph.
|
