无向图的点连通度转化为最大流来求解是个非常经典的模型了。
当源与汇固定时
构建网络流模型:
若G为无向图:
(1)原G图中的每个顶点V变成N网中的两个顶点V'和V'',顶点V'至V''有一条弧容量为1;
(2)原图G中的每条边e=(U,V),在N网中有两条弧e'=(U'',V'),e''=(V'',U')与之对应,e'与e''容量均为无穷;
(3)求最大流。
而源与汇不固定时,第三步就变成固定源点,枚举汇点,求最大流,固定的源点要求不能与所有的点都相邻,选择的汇点不能和源点相邻。
本题中源与汇都已经固定, 首先就要判断两点是否相邻,相邻的话必然是不存在答案的。
然后首先求一遍最大流,目的是看源与汇是否能连通,不能连通的话答案显然是0, 求出最大流后,然后开始枚举删点。注意这里以及下文所说的删点,不是真的删掉该点以及与它有关的边,而是建图中的第(1)步不再建立而已,其他照常。
按字典序枚举点,如果是源汇则跳过,否则重新建图的时候删掉该点,重新流,如果流减小,说明该点属于最小字典序割集,加入割集。
所以,对于枚举的每个点,还需要判断一下,是否已存在于割集中,如果已存在于割集中则果断删掉,否则不删。
记得每次流完之后,如果流量减小则更新最大流,作为下一次枚举的比较值。
这样最后就求出了最小字典序割集,输出即可
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <cstdio>
#include <queue>
#include <map>
#include <set>
#define MAXN 422
#define MAXM 222222
#define INF 1000000000
using namespace std;
struct node
{
int ver; // vertex
int cap; // capacity
int flow; // current flow in this arc
int next, rev;
}edge[MAXM];
int dist[MAXN], numbs[MAXN], src, des, n;
int head[MAXN], e;
void add(int x, int y, int c)
{ //e记录边的总数
edge[e].ver = y;
edge[e].cap = c;
edge[e].flow = 0;
edge[e].rev = e + 1; //反向边在edge中的下标位置
edge[e].next = head[x]; //记录以x为起点的上一条边在edge中的下标位置
head[x] = e++; //以x为起点的边的位置
//反向边
edge[e].ver = x;
edge[e].cap = 0; //反向边的初始网络流为0
edge[e].flow = 0;
edge[e].rev = e - 1;
edge[e].next = head[y];
head[y] = e++;
}
void rev_BFS()
{
int Q[MAXN], qhead = 0, qtail = 0;
for(int i = 1; i <= n; ++i)
{
dist[i] = MAXN;
numbs[i] = 0;
}
Q[qtail++] = des;
dist[des] = 0;
numbs[0] = 1;
while(qhead != qtail)
{
int v = Q[qhead++];
for(int i = head[v]; i != -1; i = edge[i].next)
{
if(edge[edge[i].rev].cap == 0 || dist[edge[i].ver] < MAXN)continue;
dist[edge[i].ver] = dist[v] + 1;
++numbs[dist[edge[i].ver]];
Q[qtail++] = edge[i].ver;
}
}
}
void init()
{
e = 0;
memset(head, -1, sizeof(head));
}
int maxflow()
{
int u, totalflow = 0;
int Curhead[MAXN], revpath[MAXN];
for(int i = 1; i <= n; ++i)Curhead[i] = head[i];
u = src;
while(dist[src] < n)
{
if(u == des) // find an augmenting path
{
int augflow = INF;
for(int i = src; i != des; i = edge[Curhead[i]].ver)
augflow = min(augflow, edge[Curhead[i]].cap);
for(int i = src; i != des; i = edge[Curhead[i]].ver)
{
edge[Curhead[i]].cap -= augflow;
edge[edge[Curhead[i]].rev].cap += augflow;
edge[Curhead[i]].flow += augflow;
edge[edge[Curhead[i]].rev].flow -= augflow;
}
totalflow += augflow;
u = src;
}
int i;
for(i = Curhead[u]; i != -1; i = edge[i].next)
if(edge[i].cap > 0 && dist[u] == dist[edge[i].ver] + 1)break;
if(i != -1) // find an admissible arc, then Advance
{
Curhead[u] = i;
revpath[edge[i].ver] = edge[i].rev;
u = edge[i].ver;
}
else // no admissible arc, then relabel this vertex
{
if(0 == (--numbs[dist[u]]))break; // GAP cut, Important!
Curhead[u] = head[u];
int mindist = n;
for(int j = head[u]; j != -1; j = edge[j].next)
if(edge[j].cap > 0)mindist = min(mindist, dist[edge[j].ver]);
dist[u] = mindist + 1;
++numbs[dist[u]];
if(u != src)
u = edge[revpath[u]].ver; // Backtrack
}
}
return totalflow;
}
int mp[MAXN][MAXN];
int ans[MAXN], cnt;
int main()
{
int N, S, T;
while(scanf("%d%d%d", &N, &S, &T) != EOF)
{
memset(mp, 0, sizeof(mp));
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
scanf("%d", &mp[i][j]);
if(mp[S][T])
{
printf("NO ANSWER!\n");
continue;
}
init();
cnt = 0;
n = 2 * N;
src = S + N;
des = T;
for(int i = 1; i <= N; i++) add(i, i + N, 1);
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
if(mp[i][j]) add(i + N, j, INF);
rev_BFS();
int flow = maxflow();
if(flow == 0)
{
printf("0\n");
continue;
}
for(int i = 1; i <= N; i++)
{
init();
for(int j = 1; j <= N; j++)
{
if(j == S || j == T || j == i) continue;
bool flag = false;
for(int k = 0; k < cnt; k++)
if(ans[k] == j)
{
flag = true;
break;
}
if(!flag) add(j, j + N, 1);
}
for(int j = 1; j <= N; j++)
for(int k = 1; k <= N; k++)
if(mp[j][k]) add(j + N, k, INF);
rev_BFS();
int tmp = maxflow();
if(tmp < flow)
{
ans[cnt++] = i;
flow = tmp;
}
}
printf("%d\n", cnt);
for(int i = 0; i < cnt - 1; i++) printf("%d ", ans[i]);
printf("%d\n", ans[cnt - 1]);
}
return 0;
}