Subject: [Boost-commit] svn:boost r48801 - sandbox/SOC/2006/tree/trunk/libs/tree/doc
Date: 2008-09-16 15:42:11
Date: 2008-09-16 15:42:11 EDT (Tue, 16 Sep 2008)
New Revision: 48801
Some doc additions (algorithms).
Text files modified:
sandbox/SOC/2006/tree/trunk/libs/tree/doc/algorithms.qbk | 8 ++++++++
1 files changed, 8 insertions(+), 0 deletions(-)
--- sandbox/SOC/2006/tree/trunk/libs/tree/doc/algorithms.qbk (original)
+++ sandbox/SOC/2006/tree/trunk/libs/tree/doc/algorithms.qbk 2008-09-16 15:42:11 EDT (Tue, 16 Sep 2008)
@@ -21,6 +21,14 @@
iterators starting at the first element linearly and terminating past the last element,
there is no one such "natural" traversal for subtrees.
+There are, conversely, several different methods how to traverse a (sub)tree - one
+has to choose eg whether to "visit" an element before, between or after its descendants.
+These three types of traversal are called pre- in- and postorder, and consequently, an
+algorithm can come in each out of these three flavors (and many algorithms will come in
+all three). For clarity, all the algorithms of one such traversal type are bundled in a
+namespace of the corresponding name (ie, `preorder`, `inorder`, and `postorder`).
[section Pre-, In-, and Postorder Algorithms]
[endsect] [/ Pre-, In-, and Postorder Algorithms]
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk