|
In this paper David Kind and John Launchbury show how to implement several important graph algorithms (e.g., connceted components) via reusable components in Haskell.
As opposed to many examples of functional programming the authors are quite interested in efficiency and, more importantly, the time complexity of the various algorithms.
Posted to functional by Ehud Lamm on 8/4/02; 6:10:24 AM
|
|
Structuring Depth-First Search Algorithms in Haskell
