Linear−time Breadth−first Tree Algorithms: An Exercise in the Arithmetic of Folds and Zips
This paper is about an application of the mathematics of the zip, reduce (fold) and accumulate (scan) operations on lists. It gives an account of the derivation of a linear-time breadth-first tree traversal algorithm, and of a subtle and efficient breadth-first tree labelling algorithm.
| Автори: | , |
|---|---|
| Формат: | Report |
| Опубліковано: |
Dept of Computer Science‚ University of Auckland
1993
|
| Резюме: | This paper is about an application of the mathematics of the zip, reduce (fold) and accumulate (scan) operations on lists. It gives an account of the derivation of a linear-time breadth-first tree traversal algorithm, and of a subtle and efficient breadth-first tree labelling algorithm. |
|---|