在图中利用递归算法遍历
int way(int road[MAX][MAX],int dnode,int path[MAX],int node_num)
{
printf ("path");
int flag=2;
int i=0,j=0,k=0;
for(i=0;i<node_num;i++)
{
if(road[i][0]==path[path[MAX-1]])
{
for(j=1;j<road[i][MAX-1];j++)
{
for(k=0;k<path[MAX-1];k++)
{
if(road[i][j]=path[k])
{
flag=0;break;
}
else flag=1;
}
if(flag==1&&road;[i][j]==dnode)
{
printf ("path");
continue;
}
if(flag==1&&road;[i][j]!=dnode)
{
path[path[MAX-1]]=road[i][j];
path[MAX]+=1;
way(road,dnode,path,node_num);
}
}
}
}
return 0;
}