数据结构DFS深度优先遍历非递归算法实现

struct arcnode
{
int adjvex;
arcnode *nextarc;
};
struct adjlist
{
int data;
arcnode *firstarc;
};
#define max 10
#include<stdio.h>
#include<malloc.h>
int main()
{
adjlist a[6];
int j;
for(j=0;j<6;j++)
a[j].firstarc=NULL;
arcnode *p=(arcnode*)malloc(sizeof(arcnode));
p->adjvex=1;
p->nextarc=NULL;
arcnode *p1=(arcnode*)malloc(sizeof(arcnode));
p1->adjvex=2;
p1->nextarc=NULL;



a[0].data=0;
a[0].firstarc=p;