| Paketname | sgb |
| Beschreibung | The Stanford GraphBase: combinatorial data and algorithms |
| Archiv/Repository | Offizielles Debian Archiv squeeze (non-free) |
| Version | 1:20050409-2 |
| Sektion | non-free/math |
| Priorität | extra |
| Installierte Größe | 976 Byte |
| Hängt ab von | libc6 (>= 2.3.6-6) |
| Empfohlene Pakete | tetex-bin (>= 3.0) | texlive-extra-utils |
| Paketbetreuer | Julian Gilbey |
| Quelle | |
| Paketgröße | 378484 Byte |
| Prüfsumme MD5 | d3bfa1db536dd209ec96f54c4f78d490 |
| Prüfsumme SHA1 | 09246a01ff4474c7fc4d7d344bf3f2c1f0095aef |
| Prüfsumme SHA256 | 6c6dacddad00ac27682d3e6a0e84af4abc05e5c57180ed535cc0e37e661ad63c |
| Link zum Herunterladen | sgb_20050409-2_i386.deb |
| Ausführliche Beschreibung | 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.
.
This package contains only the libraries and the demonstration
programs; for the readable source code, which forms the documentation
as well, see the sgb-doc package.
|