采用邻接表存储结构，编写一个判别无向图中任意给定的两个顶点之间是否存在一条长度为k的简单路径的算法

DEVC++运行成功
.............................................

#include<stdio.h>
#include<stdlib.h>
#define MAXV 100
typedef struct//邻接矩阵存储结构
{
int no;
int info;
}VertexType;

typedef struct
{
int edges[MAXV][MAXV];
int n,e;
VertexType vexs[MAXV];
}MGraph;

typedef struct ANode //邻接表存储结构
{
int adjvex;
struct ANode *nextarc;
int info;
}ArcNode;

typedef struct Vnode
{
int data;
ArcNode *firstarc;
}VNode;

typedef VNode AdjList[MAXV];

typedef struct
{
AdjList adjlist;
int n,e;
}ALGraph;

typedef struct node
{
int data;
struct node *next;
}List;

void MatToList(MGraph g,ALGraph *&G)
{
int i,j,n=g.n;
ArcNode *p;
G=(ALGraph *)malloc(sizeof(ALGraph));
for(i=0;i<n;i++)
G->adjlist