1.1 --- a/lemon/smart_graph.h	Fri Oct 19 13:50:13 2007 +0000
     1.2 +++ b/lemon/smart_graph.h	Fri Oct 19 15:21:07 2007 +0000
     1.3 @@ -185,10 +185,10 @@
     1.4  
     1.5    typedef GraphExtender<SmartGraphBase> ExtendedSmartGraphBase;
     1.6  
     1.7 -  /// \ingroup graphs
     1.8 -
     1.9 -  ///A smart graph class.
    1.10 -
    1.11 +  ///\ingroup graphs
    1.12 +  ///
    1.13 +  ///\brief A smart graph class.
    1.14 +  ///
    1.15    ///This is a simple and fast graph implementation.
    1.16    ///It is also quite memory efficient, but at the price
    1.17    ///that <b> it does support only limited (only stack-like)
    1.18 @@ -571,9 +571,9 @@
    1.19        edges[n | 1].target = v.id;
    1.20  
    1.21        edges[n].next_out = nodes[v.id].first_out;
    1.22 -      edges[n | 1].next_out = nodes[u.id].first_out;
    1.23 -	
    1.24        nodes[v.id].first_out = n;
    1.25 +
    1.26 +      edges[n | 1].next_out = nodes[u.id].first_out;	
    1.27        nodes[u.id].first_out = (n | 1);
    1.28  
    1.29        return UEdge(n / 2);