sgb - Online in the Cloud

ໂຄງການ:

NAME

sgb - The Stanford GraphBase: combinatorial data and algorithms

ລາຍລະອຽດ

ຫນ້າຄູ່ມືນີ້ເອກະສານສັ້ນໆກ່ຽວກັບ Stanford GraphBase system. This manual page was
ຂຽນສໍາລັບການແຈກຢາຍ Debian GNU/Linux (ແຕ່ອາດຈະຖືກນໍາໃຊ້ໂດຍຜູ້ອື່ນ), ເພາະວ່າ
ໂຄງການຕົ້ນສະບັບບໍ່ມີຫນ້າຄູ່ມື.

ໄດ້ Stanford GraphBase, created by Prof. Donald Knuth of Stanford University, is 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.

More details about the Stanford GraphBase can be found in the file
/usr/share/doc/sgb/abstract.dvi.gz. It can be viewed using xdvi. It can also be
converted from DVI to some other format: a PostScript version can be created by using the
ຄໍາສັ່ງ:
dvip -o abstract.ps abstract.dvi
If you prefer less readable ASCII version instead of Postscript, you can create it by the
ບໍ່ເສຍຄ່າ dvi2tty ໂຄງການ:
dvi2tty -w132 -e-40 abstract.dvi >abstract.txt

Complete instructions to the Stanford Graphbase appear in the book by D. E. Knuth entitled
ໄດ້ Stanford GraphBase: A ເວທີ ສໍາລັບການ ຄູ່ປະສົມ ຄອມພິວເຕີ published jointly by ACM
Press and Addison-Wesley (1993), ISBN 0-201-54275-7.

All of the source code may be found in the directory /usr/sgb/doc/src. The code may be
read directly, or can be turned into a pretty-printable TeX form by using the ຖັກແສ່ວ
ໂຄງການ. ເບິ່ງ cweb(1) manpage for more details. The source code forms the main
ເອ​ກະ​ສານ​ຂອງ​ libgb ຫ້ອງສະຫມຸດ.

Use sgb online using onworks.net services