lemon/list_graph.h
changeset 219 b9c6a47c977b
parent 209 765619b7cbb2
child 220 a5d8c039f218
equal deleted inserted replaced
6:fbfc9b3c92d5 7:24f08a8bda3f
   492     ///
   492     ///
   493     ///\todo It could be implemented in a bit faster way.
   493     ///\todo It could be implemented in a bit faster way.
   494     Node split(Node n, bool connect = true) {
   494     Node split(Node n, bool connect = true) {
   495       Node b = addNode();
   495       Node b = addNode();
   496       for(OutArcIt e(*this,n);e!=INVALID;) {
   496       for(OutArcIt e(*this,n);e!=INVALID;) {
   497          OutArcIt f=e;
   497         OutArcIt f=e;
   498         ++f;
   498         ++f;
   499         changeSource(e,b);
   499         changeSource(e,b);
   500         e=f;
   500         e=f;
   501       }
   501       }
   502       if (connect) addArc(n,b);
   502       if (connect) addArc(n,b);