Bug fix for not connected graphs
authordeba
Thu, 20 Mar 2008 11:38:01 +0000
changeset 25951cbd377bffb3
parent 2594 97dcc3c5ea31
child 2596 9c00e972cdfd
Bug fix for not connected graphs
lemon/nagamochi_ibaraki.h
     1.1 --- a/lemon/nagamochi_ibaraki.h	Fri Mar 14 14:50:04 2008 +0000
     1.2 +++ b/lemon/nagamochi_ibaraki.h	Thu Mar 20 11:38:01 2008 +0000
     1.3 @@ -1321,8 +1321,6 @@
     1.4        }
     1.5  
     1.6        if (int(nodes.size()) < _node_num) {
     1.7 -        _aux_graph->clear();
     1.8 -        _node_num = 1;
     1.9          _cut.clear();
    1.10          for (int i = 0; i < int(nodes.size()); ++i) {
    1.11            typename Graph::Node n = (*_first)[nodes[i]];
    1.12 @@ -1331,6 +1329,8 @@
    1.13              n = (*_next)[n];
    1.14            }
    1.15          }
    1.16 +	_aux_graph->clear();
    1.17 +        _node_num = 1;
    1.18          _min_cut = 0;
    1.19          return true;
    1.20        }