1、邻接表的存储
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAXN 10000
struct {
int value;
int to;
int next;
}edges[MAXN];
int cnt = 0;
int head[MAXN];
void init(){
memset(head,-1,sizeof(head));
}
void add(int u,int v,int value){
edges[cnt].to = v;
edges[cnt].value = value;
edges[cnt].next = head[u];
head[u] = cnt ++;
edges[cnt].to = u;
edges[cnt].value = value;
edges[cnt].next = head[v];
head[v] = cnt ++;
}
void Print(int n){
int i,j;
for (i=1;i<=n;i++)
{
for (j=head[i];j!=-1;j=edges[j].next) 一开始j为 以i为始点的边的编号 当j!=-1 时说明以i为始点的边还有,他在 edges[j].next 中存着
{
printf("%d->%d = %d\n",i,edges[j].to,edges[j].value);
}
}
}
int main (){
int n,m,i,u,v,value;
scanf("%d%d",&n,&m);
init();
for (i=0;i<m;i++)
{
scanf("%d%d%d",&u,&v,&value);
add(u,v,value);
}
Print(n);
}
2、拓扑排序
queue<int>q;
vector<int>edge[n];
for(int i=0;i<n;i++)
if(in[i]==0) q.push(i);
vector<int>ans;
while(!q.empty())
{
int p=q.front(); q.pop();
ans.push_back(p);
for(int i=0;i<edge[p].size();i++)
{
int y=edge[p][i];
in[y]--;
if(in[y]==0)
q.push(y);
}
}
if(ans.size()==n)
{
for(int i=0;i<ans.size();i++)
printf( "%d ",ans[i] );
printf("\n");
}
else printf("No Answer!\n");
3、dijsktra的堆优化
1 #include <cstdio>
2 #include <queue>
3 #include <iostream>
4 #include <algorithm>
5 using namespace std;
6 int n,m,s;
7 int head[100001],dis[100001],cnt;
8 bool vis[100001];
9 struct qwq{
10 int from,to,next;
11 long long len;
12 }edge[200001];
13 void add(int u,int v,int w)
14 {
15 cnt++;
16 edge[cnt].from=u;
17 edge[cnt].to=v;
18 edge[cnt].len=w;
19 edge[cnt].next=head[u];
20 head[u]=cnt;
21 return;
22 }
23 struct node{
24 int index,dist;
25 bool operator < (const node &x)const
26 {
27 return dist>x.dist;
28 }
29 };
30 priority_queue<node> q;
31 int main()
32 {
33 scanf("%d%d%d",&n,&m,&s);
34 for(int i=1;i<=m;i++)
35 {
36 int u,v,w;
37 scanf("%d%d%d",&u,&v,&w);
38 add(u,v,w);
39 }
40 for(int i=1;i<=n;i++)
41 dis[i]=2147483647;
42 dis[s]=0;
43 q.push(node{s,0});
44 while(!q.empty())
45 {
46 node x=q.top();
47 q.pop();
48 int u=x.index;
49 if(vis[u]) continue;
50 vis[u]=1;
51 for(int i=head[u];i;i=edge[i].next)
52 {
53 if(dis[edge[i].to]>dis[u]+edge[i].len)
54 {
55 dis[edge[i].to]=dis[u]+edge[i].len;
56 q.push(node{edge[i].to,dis[edge[i].to]});
57 }
58 }
59 }
60 for(int i=1;i<=n;i++)
61 printf("%d ",dis[i]);
62 return 0;
63 }
4、欧拉回路
dfs例题
fleury解释
fleury算法:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <climits>
#include <vector>
#include <queue>
#include <cstdlib>
#include <string>
#include <set>
#include <stack>
#define LL long long
#define pii pair<int,int>
#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 1000;
bool e[maxn][maxn];
int n,m;
stack<int>stk;
void dfs(int u){
stk.push(u);
for(int i = 1; i <= n; i++){
if(e[u][i]){
e[u][i] = false;
e[i][u] = false;
dfs(i);
break;
}
}
}
void Fleury(int x){
while(!stk.empty()) stk.pop();
stk.push(x);
int i;
while(!stk.empty()){
int u = stk.top();
stk.pop();
for(i = 1; i <= n; i++)
if(e[u][i]) break;
if(i <= n) dfs(u); else printf("%d ",u);
}
puts("");
}
int main() {
int u,v,cnt,degree,st;
while(~scanf("%d %d",&n,&m)){
memset(e,false,sizeof(e));
for(int i = 0; i < m; i++){
scanf("%d %d",&u,&v);
e[u][v] = e[v][u] = true;
}
cnt = 0;
st = 1;
for(int i = 1; i <= n; i++){
for(int j = 1,degree = 0; j <= n; j++)
if(e[i][j]) degree++;
if(degree&1){
st = i;
cnt++;
}
}
if(cnt == 2 || !cnt) Fleury(st);
else puts("No Euler path");
}
return 0;
}
5、tarjan求强联通分量
强连通分量+割点+桥
#include<iostream>
#include<algorithm>
#include<cstring>
#include<stack>
using namespace std;
struct ss{
int v;
int next;
}s[1000];
int head[1000];
int dfn[1000];
int low[1000];
int vis[1000];
int color[1000];
int n,m;
int cnt;
int num;
stack<int >st;
void init()
{
memset(head,-1,sizeof(head));
memset(vis,0,sizeof(vis));
memset(dfn,0,sizeof(dfn));
memset(low,0,sizeof(low));
num=0;
cnt=0;
}
void add(int u,int v)
{
s[num].v = v;
s[num].next = head[u];
head[u] = num++;
}
void Tarjan(int u)
{
st.push(u);
dfn[u] = low[u] = ++cnt;
vis[u]=1;
for(int i = head[u]; i != -1; i = s[i].next)
{
int v = s[i].v;
if(!dfn[v])
{
Tarjan(v);
low[u] = min(low[u],low[v]);
}
else if(vis[v])
low[u] = min(low[u],dfn[v]);
}
if(dfn[u]==low[u])
{
int now;
do{
now=st.top();
color[now]=u;
vis[now]=0;
st.pop();
}while(now!=u);
}
return;
}
void out()
{
for(int i=1;i<=n;i++)
printf("%d ",i);
printf("\n");
for(int i=1;i<=n;i++)
printf("%d ",color[i]);
printf("\n");
}
int main()
{
while(~scanf("%d%d",&n,&m) && (m+n))
{
init();
int u,v;
while(m--)
{
scanf("%d%d",&u,&v);
add(u,v);
}
for(int i=1;i<=n;i++)
if(!dfn[i])
Tarjan(i);
out();
}
return 0;
}
匈牙利算法和km算法
白话描述匈牙利算法
KM算法+模板