采用鄰接表存儲(chǔ)結(jié)構(gòu)，編寫(xiě)一個(gè)判別無(wú)向圖中任意給定的
兩個(gè)頂點(diǎn)之間是否存在一條長(zhǎng)度為k的簡(jiǎn)單路徑的算法。

實(shí)現(xiàn)下列函數(shù)：
Status?SinglePath（ALGraph?g?VertexType?sv?VertexType?tv
??????????????????int?k?char?*sp）;
/*?Judge?whether?it?exists?a?path?from?sv?to?tv?with?length?k?*/
/*?in?graph?g?return?path?using?string?sp?if??exists.????????*/

圖的鄰接表以及相關(guān)類型、函數(shù)和輔助變量定義如下：
Status?visited[MAX_VERTEX_NUM];
typedef?char??StrARR[100][MAX_VERTEX_NUM+1];
typedef?char?VertexType;
typedef?struct?ArcNode?{
????int?adjvex;
????struct?ArcNode?*nextarc;
}?ArcNode;

typedef?struct?VNode?{
????VertexType?data;
????ArcNode??*firstarc;
}?VNode?AdjList[MAX_VERTEX_NUM];

typedef?struct?{
????AdjList?vertices;
????int?vexnum?arcnum;
}?ALGraph;

int?LocateVex（Graph?g?VertexType?v）;
vo