1.1 --- a/src/lemon/list_graph.h	Thu Mar 31 13:31:39 2005 +0000
     1.2 +++ b/src/lemon/list_graph.h	Thu Mar 31 14:04:13 2005 +0000
     1.3 @@ -392,8 +392,8 @@
     1.4  
     1.5      ///Split a node.
     1.6  
     1.7 -    ///This function splits a node. First new node is added to the graph, then
     1.8 -    ///the source of each outgoing edge of \c n is moved to this new node.
     1.9 +    ///This function splits a node. First a new node is added to the graph,
    1.10 +    ///then the source of each outgoing edge of \c n is moved to this new node.
    1.11      ///If \c connect is \c true (this is the default value), then a new edge
    1.12      ///from \c n to the newly created node is also added.
    1.13      ///\return The newly created node.
    1.14 @@ -402,6 +402,8 @@
    1.15      ///referencing a moved edge remain
    1.16      ///valid. However <tt>InEdge</tt>'s and <tt>OutEdge</tt>'s
    1.17      ///may be invalidated.
    1.18 +    ///\warning This functionality cannot be used together with the SnapShot
    1.19 +    ///feature.
    1.20      ///\todo It could be implemented in a bit faster way.
    1.21      Node split(Node n, bool connect = true) 
    1.22      {