一般图的匹配算法,带花树算法。
今天上午无意看到了这个算法,出于好奇就像学学,结果感觉自己入了一个坑,
好难的算法,上午看到现在,还没怎么明白过来。水了一道模板题,暂且过一道
模板题吧。
AC代码:
#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string.h>
#include <string>
#include <vector>
#include <queue>
using namespace std;
const int MAXN = 600;
deque<int>qu;
///g[i][j]存放关系图:i,j是否有边 match[i]存放i所匹配的点
int inque[MAXN],inblossom[MAXN],inpath[MAXN];
int match[MAXN],pre[MAXN],base[MAXN];
int n,m,mmg;
vector<int>node[MAXN];
//找公共祖先
int findancestor(int u,int v)
{
memset(inpath,0,sizeof(inpath));
while(1)
{
u=base[u];
inpath[u]=1;
if(match[u]==-1) break;
u=pre[match[u]];
}
while(1)
{
v=base[v];
if(inpath[v]) return v;
v=pre[match[v]];
}
}
///压缩花
void reset(int u,int anc)
{
while(u != anc)
{
int v = match[u];
inblossom[base[u]] = 1;
inblossom[base[v]] = 1;
v = pre[v];
if(base[v] != anc)
pre[v] = match[u];
u = v;
}
}
void contract(int u,int v)
{
int anc=findancestor(u,v); ///求u,v的最近公共祖先
memset(inblossom,0,sizeof(inblossom));
reset(u,anc);
reset(v,anc);
if(base[u] != anc)
pre[u]=v;
if(base[v] != anc)
pre[v]=u;
for(int i=1;i<=n;i++)
{
if(inblossom[base[i]])
{
base[i] = anc;
if(!inque[i])
{
qu.push_back(i);
inque[i]=1;
}
}
}
}
bool bfs(int S,int n)
{
for(int i=0;i<=n;i++)
{
pre[i] = -1;
inque[i] = 0;
base[i] = i;
}
qu.clear();
qu.push_back(S);
inque[S] = 1;
while(!qu.empty())
{
int u = qu.front();
qu.pop_front();
for(int i = 0; i < (int)node[u].size(); i++)
{
int v = node[u][i];
if(base[v] != base[u] && match[u]!=v)
{
///v是S,说明构成了环,或者v已经有配偶
if(v == S || (match[v]!=-1 && pre[match[v]] != -1))
contract(u,v);
else if(pre[v] == -1)
{
pre[v] = u;
if(match[v] != -1) ///v已经与别人匹配,
{
qu.push_back(match[v]); ///其匹配者进
inque[match[v]] = 1;
}
else ///v没有和别人匹配,则匹配成功
{
u = v;
while(u != -1)
{
v = pre[u];
int w = match[v]; ///找到之后要展开花
match[v] = u;
match[u] = v;
u = w;
}
return true;
}
}
}
}
}
return false;
}
int solve()
{
int ans = 0;
memset(match,-1,sizeof(match));
for(int i=1;i<=n;i++)
if(match[i]==-1&&bfs(i,n))
ans++;
return ans;
}
int main()
{
while(~scanf("%d%d",&n,&m))
{
for(int i = 1; i <= n; i++)
node[i].clear();
int u,v;
for(int i = 1; i <= m; i++)
{
scanf("%d%d",&u,&v);
node[u].push_back(v);
node[v].push_back(u);
}
int ans = solve();
printf("%d\n",ans);
if(match[1] == -1)
printf("0");
else
printf("%d",match[1]);
for(int i = 2; i <= n; i++)
{
if(match[i] == -1)
printf(" 0");
else
printf(" %d",match[i]);
}
printf("\n");
}
return 0;
}