COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
03/30/04 15:37:21 (16 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@371
Message:

GraphWrappers?

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/edmonds_karp.h

    r263 r265  
    480480
    481481      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);
    484484      typename AugGraph::NodeMap<typename MutableGraph::Node>
    485485        res_graph_to_F(res_graph);
     
    496496      //Making F to the graph containing the edges of the residual graph
    497497      //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)) {
    499501        if (dist.get(res_graph.head(e))==dist.get(res_graph.tail(e))+1) {
    500502          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.