LTang

摘要：预流推进算法2(relable-front)算法，时间复杂度O(v^3) 1 // The relable-front algorithm code due to CLRS chapter 26 2 #include<iostream> 3 #include<list> 4 using namespace std; 5 const int N = 100; 6 int n; // vertex number 7 int e[N]; // residual flow of the vertex 8 int h[N]; // height of the vertex 9 i 阅读全文

摘要：预流推进算法(push-relable)，时间复杂度O(V^2E) 1 // The push-relable algorithm code due to CLRS chapter 26 2 #include<iostream> 3 #include<list> 4 using namespace std; 5 const int N = 100; 6 int n; // vertex number 7 int e[N]; // residual flow of the vertex 8 int h[N]; // height of the vertex 9 int c 阅读全文