Network-Flow

//Created by pritry int graph[MAX][MAX]; //原图 int source; //起点，这里为0 int sink; //终点，这里为n-1 int e[MAX]; //余流 int h[MAX]; //高度 int n; //顶点数 struct Labe

>>阅读原文<<