Changeset 392:b8d635e1672d in lemon0.x for src/work/jacint/preflow_res.h
 Timestamp:
 04/24/04 16:25:03 (20 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@523
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/work/jacint/preflow_res.h
r390 r392 16 16 17 17 template <typename Graph, typename T, 18 typename CapMap=typename Graph:: EdgeMap<T>,19 typename FlowMap=typename Graph:: EdgeMap<T> >18 typename CapMap=typename Graph::template EdgeMap<T>, 19 typename FlowMap=typename Graph::template EdgeMap<T> > 20 20 class PreflowRes { 21 21 … … 70 70 int b=k; //bound on the highest level under n of an active node 71 71 72 typename Graph:: NodeMap<int> level(G,n);73 typename Graph:: NodeMap<T> excess(G);72 typename Graph::template NodeMap<int> level(G,n); 73 typename Graph::template NodeMap<T> excess(G); 74 74 75 75 std::vector<Node> active(n1,INVALID); 76 typename Graph:: NodeMap<Node> next(G,INVALID);76 typename Graph::template NodeMap<Node> next(G,INVALID); 77 77 //Stack of the active nodes in level i < n. 78 78 //We use it in both phases. 79 79 80 typename Graph:: NodeMap<Node> left(G,INVALID);81 typename Graph:: NodeMap<Node> right(G,INVALID);80 typename Graph::template NodeMap<Node> left(G,INVALID); 81 typename Graph::template NodeMap<Node> right(G,INVALID); 82 82 std::vector<Node> level_list(n,INVALID); 83 83 /*
Note: See TracChangeset
for help on using the changeset viewer.