File: control

package info (click to toggle)
toposort 1.5-1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 124 kB
  • ctags: 24
  • sloc: python: 213; sh: 40; makefile: 6
file content (39 lines) | stat: -rw-r--r-- 1,605 bytes parent folder | download
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
Source: toposort
Section: python
Priority: optional
Maintainer: Luca Falavigna <dktrkranz@debian.org>
Uploaders: Debian Python Modules Team <python-modules-team@lists.alioth.debian.org>
Build-Depends: debhelper (>= 9),
               dh-python,
               python-all (>= 2.6.6-3~),
               python-setuptools,
               python3-all,
               python3-setuptools
Homepage: https://bitbucket.org/ericvsmith/toposort
Standards-Version: 3.9.8
X-Python-Version: >= 2.7
X-Python3-Version: >= 3.2
Vcs-Git: https://anonscm.debian.org/git/python-modules/packages/toposort.git
Vcs-Browser: https://anonscm.debian.org/cgit/python-modules/packages/toposort.git

Package: python-toposort
Architecture: all
Depends: ${python:Depends}, ${misc:Depends}
Description: topological sort algorithm - Python 2 module
 In computer science, a topological sort (sometimes abbreviated
 topsort or toposort) or topological ordering of a directed graph is a
 linear ordering of its vertices such that for every directed edge uv
 from vertex u to vertex v, u comes before v in the ordering.
 .
 This package provides this algorithm for Python.

Package: python3-toposort
Architecture: all
Depends: ${python3:Depends}, ${misc:Depends}
Description: topological sort algorithm - Python 3 module
 In computer science, a topological sort (sometimes abbreviated
 topsort or toposort) or topological ordering of a directed graph is a
 linear ordering of its vertices such that for every directed edge uv
 from vertex u to vertex v, u comes before v in the ordering.
 .
 This package provides this algorithm for Python 3.