Changeset 1281:164ca6938d09 in lemon-0.x for src/lemon/list_graph.h

Timestamp:

03/31/05 15:29:05 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1713

Message:

• split() added

File:

• src/lemon/list_graph.h (modified) (2 diffs)

src/lemon/list_graph.h

@@ -369 +369 @@
     ///
     ///\note The <tt>Edge</tt>s
-    ///referencing the moved edge remain
+    ///referencing a moved edge remain
     ///valid. However <tt>InEdge</tt>'s and <tt>OutEdge</tt>'s
     ///may be invalidated.
@@ -391 +391 @@
     }
 
-
+    ///Split a node.
+
+    ///This function splits a node. First new node is added to the graph, then
+    ///the source of each outgoing edge of \c n is moved to this new node.
+    ///If \c connect is \c true (this is the default value), then a new edge
+    ///from \c n to the newly created node is also added.
+    ///\return The newly created node.
+    ///
+    ///\note The <tt>Edge</tt>s
+    ///referencing a moved edge remain
+    ///valid. However <tt>InEdge</tt>'s and <tt>OutEdge</tt>'s
+    ///may be invalidated.
+    ///\todo It could be implemented in a bit faster way.
+    Node split(Node n, bool connect = true) 
+    {
+      Node b = addNode();
+      for(OutEdgeIt e(*this,n);e!=INVALID;) {
+        OutEdgeIt f=e;
+        ++f;
+        moveSource(e,b);
+        e=f;
+      }
+      if(connect) addEdge(n,b);
+      return b;
+    }
+      
     ///Class to make a snapshot of the graph and to restrore to it later.