Changeset 265:bf7aea53635a in lemon-0.x for src/work/edmonds_karp.h

Timestamp:

03/30/04 15:37:21 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

GraphWrappers?

File:

• src/work/edmonds_karp.h (modified) (2 diffs)

src/work/edmonds_karp.h

@@ -480 +480 @@
 
       MutableGraph F;
-      typedef SubGraphWrapper<AugGraph, DistanceMap<AugGraph> > FilterResGraph;
-      FilterResGraph filter_res_graph(res_graph, dist);
+      //typedef SubGraphWrapper<AugGraph, DistanceMap<AugGraph> > FilterResGraph;
+      //FilterResGraph filter_res_graph(res_graph, dist);
       typename AugGraph::NodeMap<typename MutableGraph::Node> 
         res_graph_to_F(res_graph);
@@ -496 +496 @@
       //Making F to the graph containing the edges of the residual graph 
       //which are in some shortest paths
-      for(typename AugGraph::EdgeIt e=res_graph.template first<typename AugGraph::EdgeIt>(); res_graph.valid(e); res_graph.next(e)) {
+      for(typename AugGraph::EdgeIt e=res_graph.template first<typename AugGraph::EdgeIt>(); 
+          res_graph.valid(e); 
+          res_graph.next(e)) {
         if (dist.get(res_graph.head(e))==dist.get(res_graph.tail(e))+1) {
           typename MutableGraph::Edge f=F.addEdge(res_graph_to_F.get(res_graph.tail(e)), res_graph_to_F.get(res_graph.head(e)));