Changeset 17:8b29d935f1a6 in lemon-0.x

Timestamp:

01/16/04 12:22:05 (21 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

make_invalid()

File:

• src/work/marci_max_flow.hh (modified) (4 diffs)

src/work/marci_max_flow.hh

@@ -45 +45 @@
       }
       bool is_valid() { return sym.is_valid(); }
+      void make_invalid() { sym.make_invalid(); }
       void augment(T a) {
         if (resG->G.a_node(sym)==resG->G.tail(sym)) { 
@@ -82 +83 @@
     int id(const node_iterator& v) { return G.id(v); }
 
-    node_iterator invalid_node() { return G.invalid_node(); }
-    res_edge_it invalid_edge() { res_edge_it n; n.sym=G.invalid_sym_edge(); return n; }
+    //node_iterator invalid_node() { return G.invalid_node(); }
+    //res_edge_it invalid_edge() { res_edge_it n; n.sym=G.invalid_sym_edge(); return n; }
     
   };
@@ -128 +129 @@
 
         typedef node_property_vector<aug_graph_type, bool> reached_type;
-        //reached_type reached(res_graph);
-        //for(graph_traits<aug_graph_type>::each_node_iterator i=res_graph.first_node(); i.is_valid(); ++i) { reached.put(i, false); }
         reached_type reached(res_graph, false);
         reached.put(s, true); 
@@ -138 +137 @@
         typedef node_property_vector<aug_graph_type, graph_traits<aug_graph_type>::edge_iterator> pred_type;
         pred_type pred(res_graph);
-        pred.put(s, res_graph.invalid_edge());
+        graph_traits<aug_graph_type>::edge_iterator a; 
+        a.make_invalid();
+        pred.put(s, a);
 
         typedef node_property_vector<aug_graph_type, int> free_type;