Index: boost/graph/biconnected_components.hpp
===================================================================
RCS file: /cvsroot/boost/boost/boost/graph/biconnected_components.hpp,v
retrieving revision 1.15
diff -b -u -3 -r1.15 biconnected_components.hpp
--- boost/graph/biconnected_components.hpp	15 Sep 2005 02:05:00 -0000	1.15
+++ boost/graph/biconnected_components.hpp	11 Feb 2006 16:29:37 -0000
@@ -83,9 +83,9 @@
           put(lowpt, source(e, g),
               min BOOST_PREVENT_MACRO_SUBSTITUTION(get(lowpt, source(e, g)),
                                                    get(dtm, target(e, g))));
-        }
         vis.back_edge(e, g);
       }
+      }
 
       template <typename Edge, typename Graph>
       void forward_or_cross_edge(const Edge& e, Graph& g)
@@ -98,14 +98,17 @@
       {
         BOOST_USING_STD_MIN();
         Vertex parent = get(pred, u);
+        const std::size_t dtm_of_dubious_parent = get(dtm, parent);
         bool is_art_point = false;
-        if ( get(dtm, parent) > get(dtm, u) ) {
+        if ( dtm_of_dubious_parent > get(dtm, u) ) {
           parent = get(pred, parent);
           is_art_point = true;
+          put(pred, get(pred, u), u);
+          put(pred, u, parent);
         }
 
         if ( parent == u ) { // at top
-          if ( get(dtm, u) + 1 == get(dtm, get(pred, u)) )
+          if ( get(dtm, u) + 1 == dtm_of_dubious_parent )
             is_art_point = false;
         } else {
           put(lowpt, parent,
Index: libs/graph/doc/biconnected_components.html
===================================================================
RCS file: /cvsroot/boost/boost/libs/graph/doc/biconnected_components.html,v
retrieving revision 1.3
diff -b -u -3 -r1.3 biconnected_components.html
--- libs/graph/doc/biconnected_components.html	12 Sep 2005 15:25:09 -0000	1.3
+++ libs/graph/doc/biconnected_components.html	11 Feb 2006 16:29:39 -0000
@@ -192,9 +192,9 @@
   <b>Python</b>: Unsupported parameter.
 </blockquote>
 
-UTIL: <tt>predecessor_map(PredecessorMap p_map)</tt> 
+UTIL/OUT: <tt>predecessor_map(PredecessorMap p_map)</tt> 
 <blockquote>
-  The predecessor map is unusable after algorithm's completion. 
+  The predecessor map records the depth first search tree. 
   The <tt>PredecessorMap</tt> type
   must be a <a
   href="../../property_map/ReadWritePropertyMap.html">Read/Write