next up previous
Next: 3. What are People Up: Who is Interested in Repository Previous: 1. Introduction

   
2. The Stony Brook Algorithms Repository

The Stony Brook Algorithms Repository was developed in parallel with my book [#!Skiena-97!#], The Algorithm Design Manual, and the structure of the repository mirrors the organization of my book. The world has been divided into a total of 75 fundamental algorithmic problems, partitioned among data structures, numerical algorithms, combinatorial algorithms, graph algorithms, hard problems, and computational geometry. See Table 6 or http://www.cs.sunysb.edu/$\sim$algorith for the list of 75 problems.

For each problem, the book poses questions to try to reveal the issues inherent in a proper formulation, and then tries to suggest the most pragmatic algorithm solution available. Where appropriate, relevant implementations are noted in the book, and collected on the Algorithms Repository, most of which has been mirrored on a CD-ROM included with the book. In total, we have identified a collection of 56 relevant algorithm implementations. Finding these codes required a substantial effort. Since many of these implementations proved applicable to more than one problem, the repository contains an average of three relevant implementations per problem.

Each problem page has a link to each relevant implementation page, as well as to pages associated with closely related problems. Each implementation page contains a link to the page associated with each problem to which it is applicable. Further, indexes contain links to implementations by programming language, subject area, and pictorial representation. Together these links enable the user to move easily through the site.


next up previous
Next: 3. What are People Up: Who is Interested in Repository Previous: 1. Introduction
Steve Skiena
1999-10-15