图的领接矩阵和深度遍历

#include"fstream"
#include"iostream"
using namespace std;
const int MaxInt = 32767;//表示极大值
const int MVNum = 100;//最大顶点数
typedef int Status;
bool visited[MVNum];
int i, j;
typedef struct {
<span style="white-space:pre">	</span>char vexs[MVNum]; //创建顶点表
<span style="white-space:pre">	</span>int arcs[MVNum][MVNum];//领接矩阵
<span style="white-space:pre">	</span>int vexnum, arcnum; //图的当前点数和边数


}AMGraph;
int LocateVex(AMGraph G, char v)//图的基本操作，寻找V的位置
{
<span style="white-space:pre">	</span>int i = 0;
<span style="white-space:pre">	</span>while (i < G.vexnum && v != G.vexs[i])
<span style="white-space:pre">		</span>i++;
<span style="white-space:pre">	</span>return i;
}
int CreateUDN(AMGraph &G) {
<span style="white-space:pre">	</span>char v1, v2; int w;
<span style="white-space:pre">	</span>fstream in;
<span style="white-space:pre">	</span>in.open("data.txt", ios::in);
<span style="white-space:pre">	</span>in &g