Changeset 265:bf7aea53635a in lemon0.x for src/work/edmonds_karp.h
 Timestamp:
 03/30/04 15:37:21 (17 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@371
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/work/edmonds_karp.h
r263 r265 480 480 481 481 MutableGraph F; 482 typedef SubGraphWrapper<AugGraph, DistanceMap<AugGraph> > FilterResGraph;483 FilterResGraph filter_res_graph(res_graph, dist);482 //typedef SubGraphWrapper<AugGraph, DistanceMap<AugGraph> > FilterResGraph; 483 //FilterResGraph filter_res_graph(res_graph, dist); 484 484 typename AugGraph::NodeMap<typename MutableGraph::Node> 485 485 res_graph_to_F(res_graph); … … 496 496 //Making F to the graph containing the edges of the residual graph 497 497 //which are in some shortest paths 498 for(typename AugGraph::EdgeIt e=res_graph.template first<typename AugGraph::EdgeIt>(); res_graph.valid(e); res_graph.next(e)) { 498 for(typename AugGraph::EdgeIt e=res_graph.template first<typename AugGraph::EdgeIt>(); 499 res_graph.valid(e); 500 res_graph.next(e)) { 499 501 if (dist.get(res_graph.head(e))==dist.get(res_graph.tail(e))+1) { 500 502 typename MutableGraph::Edge f=F.addEdge(res_graph_to_F.get(res_graph.tail(e)), res_graph_to_F.get(res_graph.head(e)));
Note: See TracChangeset
for help on using the changeset viewer.