pkgsrc/devel/sgb/distinfo

$NetBSD: distinfo,v 1.2 2009/01/04 23:14:00 dbj Exp $

SHA1 (sgb-2007-03.28.tar.gz) = 651cc1ea52a3ea10d00276e7fb09458bb344072c
RMD160 (sgb-2007-03.28.tar.gz) = 5da2b7835e051f9e4224a9e56ec17aafba54d864
Size (sgb-2007-03.28.tar.gz) = 493980 bytes
SHA1 (patch-aa) = 310fb196a09cdc0255d491ebad9d3c2ec1c18c38
update to sgb-2007-03.28.tar.gz distribution 2009-01-05 00:14:00 +01:00			$NetBSD: distinfo,v 1.2 2009/01/04 23:14:00 dbj Exp $
Import sgb. The Stanford GraphBase is a highly portable collection of programs and data for researchers who study combinatorial algorithms and data structures. All files are in the public domain and usable with only one restriction: They must not be changed! A ``change file'' mechanism allows local customization while the master files stay intact. 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. 2006-05-04 11:35:33 +02:00
update to sgb-2007-03.28.tar.gz distribution 2009-01-05 00:14:00 +01:00			`SHA1 (sgb-2007-03.28.tar.gz) = 651cc1ea52a3ea10d00276e7fb09458bb344072c`
			`RMD160 (sgb-2007-03.28.tar.gz) = 5da2b7835e051f9e4224a9e56ec17aafba54d864`
			`Size (sgb-2007-03.28.tar.gz) = 493980 bytes`
Import sgb. The Stanford GraphBase is a highly portable collection of programs and data for researchers who study combinatorial algorithms and data structures. All files are in the public domain and usable with only one restriction: They must not be changed! A ``change file'' mechanism allows local customization while the master files stay intact. 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. 2006-05-04 11:35:33 +02:00			`SHA1 (patch-aa) = 310fb196a09cdc0255d491ebad9d3c2ec1c18c38`