[Boost-commit] svn:boost r46397 - sandbox/SOC/2006/tree/trunk

From: ockham_at_[hidden]
Date: 2008-06-14 17:31:29

Author: bernhard.reiter
Date: 2008-06-14 17:31:28 EDT (Sat, 14 Jun 2008)
New Revision: 46397
URL: http://svn.boost.org/trac/boost/changeset/46397

Log:
TODO notes
Text files modified: 
   sandbox/SOC/2006/tree/trunk/TODO |     3 +++                                     
   1 files changed, 3 insertions(+), 0 deletions(-)

Modified: sandbox/SOC/2006/tree/trunk/TODO
==============================================================================
--- sandbox/SOC/2006/tree/trunk/TODO	(original)
+++ sandbox/SOC/2006/tree/trunk/TODO	2008-06-14 17:31:28 EDT (Sat, 14 Jun 2008)
@@ -14,6 +14,8 @@
 [section TODO]
 
 General:
+* Revisit binary_tree. Can it be usable for both balanced and forest trees and still be
+  "light-weight" at the same time?
 * Re-organize traversal tests:
   * Verify recursive algorithms to work
     * 1. with a tree filled with given data
@@ -104,6 +106,7 @@
 
 Documentation:
 
+* Take a look at BGL docs; they seem to be really well structured and written.
 * Add some illustrations
 * Overview: develop hierarchy/cursor concept step by step, using illustrations that 
   depict what is introduced at what step (nodes with pointers to their siblings, children, parents,