File: control

package info (click to toggle)
sgb 1%3A1996-7
  • links: PTS
  • area: main
  • in suites: hamm, slink
  • size: 1,600 kB
  • ctags: 26
  • sloc: makefile: 171; sh: 3
file content (20 lines) | stat: -rw-r--r-- 860 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
Source: sgb
Section: math
Priority: optional
Maintainer: Milan Zamazal <pdm@fi.muni.cz>
Standards-Version: 2.4.1.0

Package: sgb
Architecture: any
Depends: ${shlibs:Depends}
Suggests: cweb (>= 3.4g-6)
Description: The Stanford GraphBase: combinatorial data and algorithms.
 A highly portable collection of programs and data for researchers who study
 combinatorial algorithms and data structures.
 .
 The programs are intended to be interesting in themselves as examples of
 literate programming.  Thus, the Stanford GraphBase can also be regarded as a
 collection of approximately 30 essays for programmers to enjoy reading,
 whether or not they are doing algorithmic research.  The programs are written
 in CWEB, a combination of TeX and C that is easy to use by anyone who knows
 those languages and easy to read by anyone familiar with the rudiments of C.