Changeset 17:8b29d935f1a6 in lemon-0.x for src
- Timestamp:
- 01/16/04 12:22:05 (21 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@30
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/work/marci_max_flow.hh
r14 r17 45 45 } 46 46 bool is_valid() { return sym.is_valid(); } 47 void make_invalid() { sym.make_invalid(); } 47 48 void augment(T a) { 48 49 if (resG->G.a_node(sym)==resG->G.tail(sym)) { … … 82 83 int id(const node_iterator& v) { return G.id(v); } 83 84 84 node_iterator invalid_node() { return G.invalid_node(); }85 res_edge_it invalid_edge() { res_edge_it n; n.sym=G.invalid_sym_edge(); return n; }85 //node_iterator invalid_node() { return G.invalid_node(); } 86 //res_edge_it invalid_edge() { res_edge_it n; n.sym=G.invalid_sym_edge(); return n; } 86 87 87 88 }; … … 128 129 129 130 typedef node_property_vector<aug_graph_type, bool> reached_type; 130 //reached_type reached(res_graph);131 //for(graph_traits<aug_graph_type>::each_node_iterator i=res_graph.first_node(); i.is_valid(); ++i) { reached.put(i, false); }132 131 reached_type reached(res_graph, false); 133 132 reached.put(s, true); … … 138 137 typedef node_property_vector<aug_graph_type, graph_traits<aug_graph_type>::edge_iterator> pred_type; 139 138 pred_type pred(res_graph); 140 pred.put(s, res_graph.invalid_edge()); 139 graph_traits<aug_graph_type>::edge_iterator a; 140 a.make_invalid(); 141 pred.put(s, a); 141 142 142 143 typedef node_property_vector<aug_graph_type, int> free_type;
Note: See TracChangeset
for help on using the changeset viewer.