|
This page is the main entry point of Algorithm Concepts, a collection of algorithm concept descriptions in both Web page and print form under development at Rensselaer Polytechnic Institute by David R. Musser, with the aid of graduate research assistants Brian Osman, Michael LaSpina, and Mayuresh Kulkarni, and with significant participation also of students in the "Adopt an Algorithm" project in CSCI-4020 Computer Algorithms, Spring 2002 and Spring 2003. Currently this concept web covers many of the sequence algorithms in the C++ Standard Template Library (STL) and many of the graph algorithms in the Boost Graph Library (BGL), which was developed by Andrew Lumsdaine's group at Indiana University. The development of this Algorithms concept web is part of a project called "Open Compilation for Self-Optimizing Generic Components," being conducted jointly with Lumdaine's group and sponsored by NSF grant 0131354. In this concept web, the first page of each concept document contains a small graph of the local neighborhood of the concept in the overall web. For the "big picture," see also the following graphs depicting most of the hierarchy of concepts covered (although there are a few discrepancies between these graphs and the above concept web in the organization and naming of concepts): Here are several entry points into the concept web:
|