Moret and Shapiro's Algorithms P to NP

Moret and Shapiro's Algorithms P to NP

This algorithms text distinguishes itself by including Pascal implementations of many algorithms, with careful experimental comparisons of different algorithms for such problems as sorting and minimum spanning tree, and heuristics for the traveling salesman problem. It provides a useful model for how to properly do empirical algorithm analysis.

The programs themselves are probably best used as models. Interesting implementations include the eight-queens problem, fundamental graph and geometric algorithms.

The programs in the book have been made available by anonymous ftp from in directory /pub/moret_shapiro.

  • Link to Moret's Home Page - files under publications
  • Download Files (local site)

    Problem Links

  • Sorting (7)
  • Minimum Spanning Tree (5)
  • Connected Components (4)
  • Edge and Vertex Connectivity (4)
  • Discrete Fourier Transform (4)
  • Robust Geometric Primitives (4)
  • Graph Data Structures (4)
  • Matching (4)
  • Network Flow (4)
  • Set Data Structures (4)
  • Convex Hull (3)
  • Intersection Detection (3)
  • Nearest Neighbor Search (3)
  • Point Location (3)
  • Priority Queues (3)
  • Searching (3)
  • Topological Sorting (3)

    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Feb 23, 1996.