Algorithms 2

This companion book to the authors' Algorithms: Construction, Proof and Analysis (Wiley, 1986) discusses how to apply the methods for constructing, proving, and analyzing progams developed in the previous book for the solution of basic problems in data structures and graph traversing. However, this book is self-contained and may be used independently. The first part of the book studies standard data structures. The second part examines algorithms for finding paths through graphs, using the structures given in the first part. An appendix gives some Pascal programs and their results.