diff -r ea96c0acefc4 -r 290e43cddc1a lemon/smart_graph.h
--- a/lemon/smart_graph.h	Fri Oct 19 13:50:13 2007 +0000
+++ b/lemon/smart_graph.h	Fri Oct 19 15:21:07 2007 +0000
@@ -185,10 +185,10 @@
 
   typedef GraphExtender<SmartGraphBase> ExtendedSmartGraphBase;
 
-  /// \ingroup graphs
-
-  ///A smart graph class.
-
+  ///\ingroup graphs
+  ///
+  ///\brief A smart graph class.
+  ///
   ///This is a simple and fast graph implementation.
   ///It is also quite memory efficient, but at the price
   ///that <b> it does support only limited (only stack-like)
@@ -571,9 +571,9 @@
       edges[n | 1].target = v.id;
 
       edges[n].next_out = nodes[v.id].first_out;
-      edges[n | 1].next_out = nodes[u.id].first_out;
-	
       nodes[v.id].first_out = n;
+
+      edges[n | 1].next_out = nodes[u.id].first_out;	
       nodes[u.id].first_out = (n | 1);
 
       return UEdge(n / 2);