链式前向星
适用范围:稀疏图
写法:
定义类型:
struct PO{
int u,v,nex;
}e[100];
int fir[100],tot = 0;
u 是起点,v是终点,nex是对应的下一条边的编号(同起点的)。
编号的确立是由输入顺序决定的。
加边操作:
void add_ead(int u,int v){
e[++tot].u = u; e[tot].v = v; e[tot].nex = fir[u]; fir[u] = tot;
}
遍历操作:
for (int i = fir[u] ; i ;i = e[i].nex)
相关代码:
#include<iostream>
#include<queue>
#include<cstring>
#include<string>
#include<sstream>
#include<map>
#include<vector>
#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<stack>
#include<ctime>
using namespace std;
#define rep(i,aa,bb) for(register int i=aa;i<=bb;i++)
#define rrep(i,aa,bb) for(register int i=aa;i>=bb;i--)
#define LL long long
#define eps 0.000001
#define inf 0x3f3f3f3f
#define exp 0.000001
#define pai 3.141592654
#define random(x) rand()%(x)
#define lowbit(x) x&(-x)
inline int read()
{
int x=0,y=1;char a=getchar();while ( a>'9' || a<'0'){if ( a=='-')y=-1;a=getchar();}
while ( a>='0' && a<='9' ){ x=10*x+a-'0'; a=getchar();}return x*y;
}
#define N 100009
bool vis[100];int n,m; int val[100];
int fir[100]; int tot = 0;
struct PO{
int u,v,nex;
}e[100];
void add_ead(int u,int v){
e[++tot].u = u; e[tot].v = v; e[tot].nex = fir[u]; fir[u] = tot;
}
bool vis1[100];
void dfstree(int node){
vis1[node] = 1;
for (int i = fir[node] ; i ; i = e[i].nex){
if ( vis1[e[i].v] ) continue;
printf("u=%d\tv=%d\tval=%d\n",node,e[i].v,val[e[i].v]);
dfstree(e[i].v);
}
}
int main()
{
freopen("1.txt","r",stdin);
srand((int)time(0));
// std::ios::sync_with_stdio(false);
n = read();
rep(i,1,n) val[i] = read();
rep(i,1,n-1){
int a,b;
a = read(); b = read();
add_ead(a,b);
add_ead(b,a);
}
dfstree(1);
return 0;
}
//1.txt内的数据
//5
//1 -2 -3 4 5
//4 2
//3 1
//1 2
//2 5