图的深度遍历

#include<iostream> 
#define INFINITY 32767 
#define MAX_VERTEX_NUM 20 //最大顶点个数 
#define QUEUE_SIZE (MAX_VERTEX_NUM+1) //队列长度 
using namespace std; 
bool *visited; //访问标志数组 
//图的邻接矩阵存储结构 
typedef struct{ 
char *vexs; //顶点向量 
int arcs[MAX_VERTEX_NUM][MAX_VERTEX_NUM]; //邻接矩阵 
int vexnum,arcnum; //图的当前顶点数和弧数 
}Graph; 
//队列类 
class Queue{ 
public: 
void InitQueue(){ 
base=(int *)malloc(QUEUE_SIZE*sizeof(int)); 
front=rear=0; 
} 
void EnQueue(int e){ 
base[rear]=e; 
rear=(rear+1)%QUEUE_SIZE; 
} 
void DeQueue(int &e){ 
e=base[front]; 
front=(front+1)%QUEUE_SIZE; 
} 
public: 
int *base; 
int front;