Linear-time Breadth First Tree Algorithms : An exercise in the arithmetic of folds and zips

Jones, G.Gibbons, J.2009-04-082009-04-081993-05Computer Science Technical Reports 071 (1993)1173-3500http://hdl.handle.net/2292/3470This 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.https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htmLinear-time Breadth First Tree Algorithms : An exercise in the arithmetic of folds and zipsTechnical ReportFields of Research::280000 Information, Computing and Communication SciencesThe author(s)