无向图的深度优先遍历.doc

/*
#include<>
#include<>
#define MAX_VERTEX_NUM 20
typedef int InfoType;
typedef int VertexType;
typedef struct ode
{
int adjvex;
struct ode *nextarc;
InfoType * info;
}ode;
typedef struct VNode
{
VertexType data;
ode * firstarc;
}VNode, AdjList[MAX_VERTEX_NUM];
typedef struct
{
AdjList vertices;
int vexnum,um;
int kind;
} ALGraph;
int visited[20];
void CreateDG(ALGraph &G)
{
int k,i;
cout<<"请输入结点的个数"<<endl;
cin>>;
cout<<"请输入边的个数:"<<endl;
cin>>;
for(i=1; i<=; i++)
{
[i].data = i;
[i].firstarc = NULL;
}
for(k=1; k<=; k++)
{
int v1,v2;
cout<<"请输入与结点"<<k<<"相邻的边数:";
cin>>v2;
cout<<"请输入与第"<<k<<"个结点相连的结点编号:";
cin>>v1;
ode * p;
p = (ode *)malloc(sizeof(ode));
if(!p) exit(-2);
p->adjvex = v1;
p->nextarc = NULL;
[k].firstarc = p;

for(i=1; i<v2; i++)
{
int m;
cout<<"请输入与第"<<k<<"个结点相连的结点编号:";
cin>>m;
ode * q;
q = (ode *)malloc(sizeof(ode));
if(!p) exit(-2);
q->adjvex = m;
q->nextarc = NULL;
p->nextarc = q;
p