一、最小生成樹

1.1Prim算法

樸素版Prim

一般用于稠密圖

算法流程:

集合表示當(dāng)前已經(jīng)在連通塊的點(diǎn)

1.初始化距離，把所有距離都初始化為正無(wú)窮

2.n次迭代,找到集合外距離最小的點(diǎn) ->t

3.用t來(lái)更新其它點(diǎn)到集合的距離

#include<iostream>
#include<cstring>
#include<algorithm>using namespace std;const int N = 510,INF = 0x3f3f3f3f;int n,m;
int g[N][N];
int dist[N];
bool st[N];int prim()
{memset(dsit,0x3f,sizeof dsit);int res = 0;for(int i = 0;i < n;i ++){int t = -1;for(int j = 1;j <= n;j ++){if(! st[j] && (t == -1 || dist[t] > dist[j]))t = j;}if(i && dist[t] == INF) return INF;for(int j = 1;j <=n;j ++) dist[j] = min(dist[j],g[t][j]);st[t] = true;}return res;
}
int main()
{scanf("%d%d",&n,&m);memset(g,0x3f,sizeof g);while(m --){int a,b,c;scanf("%d%d%d",&a,&b,&c);g[a][b] = g[b][a] = min(g[a][b],c);}int t = prim();if(t == INF) puts("impossible");else printf("%d\n",t);return 0;
}

1.2Kruskal算法

一般用于稀疏圖

算法流程:

1.將所有邊按照權(quán)重從小到大排序

2.枚舉每一條邊(a,b)，權(quán)重為c

如果(a,b)不連通，則將這條邊加入集合中

#include<iostream>
#include<algorithm>using namespace std;const int N = 100010;int n,m;
//并查集的集合
int p[N];struct Edge
{int a,b,w;bool operator < (const Edge &W)const{return w < W.w;}
}edges[N];int find(int x)
{if(p[x] != x) p[x] = find(p[x]);return p[x];
}
int main()
{scanf("%d%d",&n,&m);for(int i = 0;i < m;i ++){int a,b,w;scanf("%d%d%d",&a,&b,&w);edges[i] = {a,b,w};}sort(edges,edges + m);for(int i = 1;i <= n;i ++) p[i] = i;int res = 0,cnt = 0;for(int i = 0; i < m; i ++){//從小到大枚舉所有邊int a = edges[i].a,b = edges[i].b,w = edges[i].w;//知道a與b的祖宗節(jié)點(diǎn)a = find(a),b = find(b);//判斷a與b是否連通if(a != b){//集合合并p[a] = b;res += w;cnt ++;}}if (cnt < n - 1) puts("impossible");else printf("%d\n",res);return 0;
}

二、二分圖

二分圖當(dāng)且僅當(dāng)圖中不含奇數(shù)環(huán)

2.1染色法

#include<iostream>
#include<cstring>
#include<algorithm>using namespace std;const int N = 100010,M = 200010;int n,m;
int h[N],e[M],ne[M],idx;
int color[N];void add(int a,int b)
{e[idx] = b,ne[idx] = h[a],h[a] = idx ++;
}bool dfs(int u,int c)
{//當(dāng)前點(diǎn)的顏色是ccolor[u] = c;for(int i = h[u];i != -1;i = ne[i]){int j = e[i];if(!color[j]){if(!dfs(j,3 - c)) return false;}else if (color[j] == c) return false;}return true;
}int main()
{scanf("%d%d",&n,&m);memset(h,-1,sizeof h);while(m --){int a,b;scanf("%d%d",&a,&b);add(a,b),add(b,a);}bool flag = true;for(int i = 1;i <=n;i ++){if(!color[i]){if(!dfs(i,1)){flag = false;break;}}}if(flag) puts("Yes");else puts("No");return 0;
}

2.2匈牙利算法

#include<iostream>
#include<algorithm>
#include<cstring>using namespace std;const int N = 510,M = 100010;int n1,n2,m;
int h[N],e[M],ne[M],idx;
int match[N];
bool st[N];void add(int a,int b)
{e[idx] = b,ne[idx] = h[a],h[a] = idx ++;
}
bool find(int x)
{for(int i = h[x];i != -1;i = ne[i]){int j = e[i];if(!st[j]){st[j] = true;if(match[j] == 0 || find(match[j])){match[j] = x;return true;}}}return false;
}
int main()
{scanf("%d%d%d",&n1,&n2,&m);memset(h,-1,sizeof h);while(m --){int a,b;scanf("%d%d",&a,&b);add(a,b);}int res = 0;for(int i = 0;i <= n1;i ++){memset(st,false,sizeof st);if(find(i)) res ++;}printf("%d\n",res);return 0;
}