COIN-OR::LEMON - Graph Library

Changeset 389:770cc1f4861f in lemon-0.x for src/work/jacint/preflow.h


Ignore:
Timestamp:
04/24/04 14:44:41 (17 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@520
Message:

modifications for better compatibility with gcc 3.4.0

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/jacint/preflow.h

    r372 r389  
    5353
    5454  template <typename Graph, typename T,
    55             typename CapMap=typename Graph::EdgeMap<T>,
    56             typename FlowMap=typename Graph::EdgeMap<T> >
     55            typename CapMap=typename Graph::template EdgeMap<T>,
     56            typename FlowMap=typename Graph::template EdgeMap<T> >
    5757  class Preflow {
    5858   
     
    100100      int b=k;    //bound on the highest level under n of an active node
    101101     
    102       typename Graph::NodeMap<int> level(G,n);     
    103       typename Graph::NodeMap<T> excess(G);
     102      typename Graph::template NodeMap<int> level(G,n);     
     103      typename Graph::template NodeMap<T> excess(G);
    104104
    105105      std::vector<Node> active(n-1,INVALID);
    106       typename Graph::NodeMap<Node> next(G,INVALID);
     106      typename Graph::template NodeMap<Node> next(G,INVALID);
    107107      //Stack of the active nodes in level i < n.
    108108      //We use it in both phases.
    109109
    110       typename Graph::NodeMap<Node> left(G,INVALID);
    111       typename Graph::NodeMap<Node> right(G,INVALID);
     110      typename Graph::template NodeMap<Node> left(G,INVALID);
     111      typename Graph::template NodeMap<Node> right(G,INVALID);
    112112      std::vector<Node> level_list(n,INVALID);
    113113      /*
Note: See TracChangeset for help on using the changeset viewer.