纯C语言：检索与周游遍历源码

#include<iostream.h>
#include<malloc.h>
#define Max 20
typedef struct Node
{
	int num;
	struct Node *next;
}Node;
Node G[Max];
int visited[Max];
void Creategraph(int n,Node G[])
{
	int i,e,j;
	Node *p,*q;
	for(i=0;i<n;i++)
	{
       G[i].num=i;
	   G[i].next=NULL;
	}
	for(i=0;i<n;i++)
	{
		cout<<"请输入第"<<i+1<<"个顶点相邻结点信息：(输入0表示无相邻结点)"<<endl;
		cin>>e;
		e=e-1;
		j=0;
		while(e!=-1&&j<n)
		{
            p=(Node*)malloc(sizeof(Node));
			p->next=NULL;
			p->num=e;
			j++;
			if(G[i].next==NULL)
				G[i].next=p;
			else q->next=p;
			q=p;
			cout<<"请输入第"<<i+1<<"个顶点相邻结点信息：(输入0表示无相邻结点)"<<endl;
		    cin>>e;
		    e=e-1;
		}
	}
}
int First(Node G[],int v)
{
	if(G[v].next!=NULL)
		return G[v].next->num;
	return -1;
}
int Next(Node G[],int v)
{
	Node *p;
	p=G[v].next;
	while(p!=NULL)
	{
		if(visited[p->num])
			p=p->next;
		else
			return p->num;
	}
	return -1;
}
void DFS(Node G[],int v)
{
	int w;
	cout<<v+1<<"  ";
	visited[v]=1;
	w=First(G,v);
	while(w!=-1)
	{
		if(visited[w]==0)
			DFS(G,w);
		w=Next(G,v);
	}
}
void main()
{
	
	int i,n;
	cout<<"请输入图的顶点个数(不大于20)："<<endl;
	cin>>n;
	Creategraph(n,G);
	for(i=0;i<n;i++)
		visited[i]=0;
	cout<<"深度遍历的顺序为："<<endl;
	for(i=0;i<n;i++)
		if(visited[i]==0)
			DFS(G,i);
		cout<<endl;
}