c++有向图 的邻接表的深度和广度优先遍历
时间: 2023-12-04 07:40:43 浏览: 74
以下是C++实现有向图邻接表的深度和广度优先遍历的示例代码:
深度优先遍历:
```c++
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=1005;
int head[maxn],cnt;
int vis[maxn];
struct node{
int to,next;
}edge[maxn*maxn];
void add(int u,int v){
edge[++cnt].to=v;
edge[cnt].next=head[u];
head[u]=cnt;
}
void dfs(int u){
vis[u]=1;
cout<<u<<" ";
for(int i=head[u];i;i=edge[i].next){
int v=edge[i].to;
if(!vis[v]) dfs(v);
}
}
int main(){
int n,m;
cin>>n>>m;
for(int i=1;i<=m;i++){
int u,v;
cin>>u>>v;
add(u,v);
}
dfs(1);
return 0;
}
```
广度优先遍历:
```c++
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=1005;
int head[maxn],cnt;
int vis[maxn];
struct node{
int to,next;
}edge[maxn*maxn];
void add(int u,int v){
edge[++cnt].to=v;
edge[cnt].next=head[u];
head[u]=cnt;
}
void bfs(int u){
queue<int> q;
q.push(u);
vis[u]=1;
while(!q.empty()){
int x=q.front();
q.pop();
cout<<x<<" ";
for(int i=head[x];i;i=edge[i].next){
int v=edge[i].to;
if(!vis[v]){
vis[v]=1;
q.push(v);
}
}
}
}
int main(){
int n,m;
cin>>n>>m;
for(int i=1;i<=m;i++){
int u,v;
cin>>u>>v;
add(u,v);
}
bfs(1);
return 0;
}
```