匈牙利算法

#include <stdio.h>
#include <string.h>
# include <fstream>
# include <iostream >
#define len 510
using namespace std;
int map[len][len];
int used[len];
int link[len];
int n;
int dfs(int a)
{
int i;
cout<<a<<"节点开始dfs\n";
for(i=1;i<=n;i++)
{
if(!used[i]&&map[a][i])
{
cout<<i<<"节点没有被使用过，且"<<i<<"节点与"<<a<<"节点相连\n";
used[i]=1;
cout<<i<<"节点标记为用过\n";
if(link[i]==-1||dfs(link[i]))
{
cout<<"把"<<i<<"节点连着的标记为"<<a<<endl;
link[i]=a;
return 1;
}
}
}
return 0;
}
int main()
{
ifstream cin("xiongyali.txt");
int a,b,m,sum,i;
while(cin>>n>>m)
{
memset(map,0,sizeof(map));
memset(link,-1,sizeof(link));
while(m--)
{
cin>>a>>b;
map[a][b]=1;
}
sum=0;
for(i=1;i<=n;i++)
{
memset(used,0,sizeof(used));
if(dfs(i)){
sum++;
cout<<"sum加1"<<endl;
}
}
printf("%d\n",sum);
}
return 1;
}

//xiongyali.txt测试数据如下
/*
6 6
1 4
1 5
2 4
2 6
3 4
3 6
即6个节点6条边，下面六行显示着哪个与哪个相连~
/*