图的深度优先搜索 c代码

来源：互联网发布：崩坏3淘宝编辑：程序博客网时间：2024/06/05 14:56

#include<stdio.h>
#include<stdlib.h>
#define MAX 30
typedef struct node{
int adjvex;
struct node *next;
}EdgeNode;
typedef struct vnode{
int vertex;
EdgeNode *firstedge;
}VertexNode;

void CreatAdjlist(VertexNode g[],int e,int n){
EdgeNode *p;
int k ,j,i;
printf("Input date of vetex(1~~n-1):\n");
for(i=0;i<n;i++)
{
  g[i].vertex=i;    //顶点信息
  g[i].firstedge=NULL;
}
for(k=1;k<=e;k++) //e条边
{
  printf("Input edge of (i,j):");
  scanf("%d,%d",&i,&j);
  p=(EdgeNode *)malloc(sizeof(EdgeNode));
  p->adjvex=j;           //在顶点vi的邻接表中添加邻接点为i的节点
  p->next=g[i].firstedge;//插入在表头
  g[i].firstedge=p;
  p=(EdgeNode *)malloc(sizeof(EdgeNode));
  p->adjvex=i;          //在顶点vj的邻接表中添加邻接点为j的节点
  p->next=g[j].firstedge;
  g[j].firstedge=p;

}
}
int visited[MAX];
void DFS(VertexNode g[],int i){
EdgeNode *p;
printf("%4d",g[i].vertex);
visited[i]=1;
p=g[i].firstedge;
while(p){
  if(!visited[p->adjvex])
   DFS(g,p->adjvex);
  p=p->next;
}
}
void DFSTraverse(VertexNode g[],int n){
int i;
for(i=0;i<n;i++)
  visited[i]=0;
for(i=0;i<n;i++)
  if(!visited[i])
   DFS(g,i);
}
void main()
{
int e,n;
VertexNode g[MAX];
printf("Input number of Node\n");
scanf("%d",&n);
printf("INput number of edge:\n");
scanf("%d",&e);
printf("Make adjlist:\n");
CreatAdjlist(g,e,n);
printf("DFStraverse:\n");
DFSTraverse(g,n);
printf("\n");
}
/*Input number of Node
4
INput number of edge:
4
Make adjlist:
Input date of vetex(1~~n-1):
Input edge of (i,j):0,1
Input edge of (i,j):0,3
Input edge of (i,j):1,3
Input edge of (i,j):1,2
DFStraverse:
   0   3   1   2
Press any key to continue*/

0 0