equal
deleted
inserted
replaced
86 //level works as a bool map in augmenting path algorithms |
86 //level works as a bool map in augmenting path algorithms |
87 //and is used by bfs for storing reached information. |
87 //and is used by bfs for storing reached information. |
88 //In preflow, it shows levels of nodes. |
88 //In preflow, it shows levels of nodes. |
89 //typename Graph::template NodeMap<int> level; |
89 //typename Graph::template NodeMap<int> level; |
90 typename Graph::template NodeMap<Num> excess; |
90 typename Graph::template NodeMap<Num> excess; |
|
91 // protected: |
|
92 // MaxFlow() { } |
|
93 // void set(const Graph& _G, Node _s, Node _t, const CapMap& _capacity, |
|
94 // FlowMap& _flow) |
|
95 // { |
|
96 // g=&_G; |
|
97 // s=_s; |
|
98 // t=_t; |
|
99 // capacity=&_capacity; |
|
100 // flow=&_flow; |
|
101 // n=_G.nodeNum; |
|
102 // level.set (_G); //kellene vmi ilyesmi fv |
|
103 // excess(_G,0); //itt is |
|
104 // } |
91 |
105 |
92 public: |
106 public: |
93 |
107 |
94 ///\todo Document this |
108 ///\todo Document this |
95 enum flowEnum{ |
109 enum flowEnum{ |