In this section, we describe several particularly comprehensive implementations of combinatorial algorithms, all of which are available over the Internet. Although these codes are discussed in the relevant sections of the catalog, they are substantial enough to warrant further attention.
A good algorithm designer does not reinvent the wheel, and a good programmer does not rewrite code that other people have written. Picasso put it best: ``Good artists borrow. Great artists steal.''
However, a word of caution about stealing. Many of the codes described below (and throughout this book) have been made available for research or educational use, although commercial use requires a licensing arrangement with the author. I urge you to respect this. Licensing terms from academic institutions are usually surprisingly modest. The recognition that industry is using a particular code is important to the authors, often more important than the money involved. This can lead to enhanced support or future releases of the software. Do the right thing and get a license. Information about terms or whom to contact is usually available embedded within the documentation, or available at the source ftp/WWW site.
Although the bulk of the systems we describe here are available by
accessing our algorithm repository, http://www.cs.sunysb.edu/ 
algorith
(as well as on the enclosed CD-ROM), we encourage you to
get them from the original sites instead of Stony Brook.
There are three reasons.
First, the version on the original site is much more likely to be maintained.
Second, there are often supporting files and documentation that we for
whatever reason did not download, and which may be of interest to you.
Finally, by ftp-ing from the original sites, you will keep traffic down at
the algorithm repository site, which will minimize the
complaints from our system
staff that I anticipate if this service becomes very popular.