采用鄰接矩陣表示圖的深度優先搜索遍歷(與深度優先搜索遍歷連通圖的遞歸算法僅僅是DFS的遍歷方式變了)

//采用鄰接矩陣表示圖的深度優先搜索遍歷(與深度優先搜索遍歷連通圖的遞歸算法僅僅是DFS的遍歷方式變了)
#include <iostream>
using namespace std;

#define MVNun 100
typedef char VerTexType;
typedef int ArcType;

typedef struct {
	VerTexType vexs[MVNun];
	ArcType arcs[MVNun][MVNun];
	int vexnum, arcnum;
}Graph;

bool visited[MVNun];
int FirstAdjVex(Graph G, int v);
int NextAdjVex(Graph G, int v, int w);

int LocateVex(Graph G, VerTexType v) {
	for (int i = 0;i < G.vexnum;++i) {
		if (G.vexs[i] == v)
			return i;
	}
	return -1;
}

void CreateUDN(Graph& G) {
	int i, j, k;
	cout << "請輸入總頂點數，總邊數 , 以空格隔開:";
	cin >> G.vexnum >> G.arcnum;
	cout << endl;
	cout << "輸入點的名稱，如 a：" << endl;

	for (i = 0;i < G.vexnum;++i) {
		cout << "請輸入第" << (i + 1) << "請輸入第";
		cin >> G.vexs[i];
	}
	cout << endl;

	for (i = 0;i < G.vexnum;++i)
		for (j = 0;j < G.vexnum;++j)
			G.arcs[i][j] = 0;
	cout << "輸入邊依附的頂點，如：a b" << endl;
	for (k = 0;k < G.arcnum;++k) {
		VerTexType v1, v2;
		cout << "請輸入第" << (k + 1) << "條邊依附的頂點:";
		cin >> v1 >> v2;
		i = LocateVex(G, v1);
		j = LocateVex(G, v2);
		G.arcs[j][i] = G.arcs[i][j] = 1;
	}
}

void DFS(Graph G, int v){        		 
	int w;
	cout << G.vexs[v] << "    ";  visited[v] = true;  		
	for(w = 0; w < G.vexnum; w++)  						
		if((G.arcs[v][w] != 0)&& (!visited[w]))  DFS(G, w);
}

int FirstAdjVex(Graph G, int v) {
	int i;
	for (i = 0;i < G.vexnum;++i) {
		if (G.arcs[v][i] == 1 && visited[i] == false)
			return i;
	}
	return -1;
}

int NextAdjVex(Graph G, int v, int w) {
	int i;
	for (i = w;i < G.vexnum;++i) {
		if (G.arcs[v][i] == 1 && visited[i] == false)
			return i;
	}
	return -1;
}

int main() {
	cout << "深度優先搜索遍歷連通圖的遞歸算法";
	Graph G;
	CreateUDN(G);
	cout << endl;
	cout << "無向連通圖G創建完成！" << endl;

	cout << "請輸入遍歷連通圖的起始點：";
	VerTexType c;
	cin >> c;

	int i;
	for (i = 0;i < G.vexnum;++i) {
		if (c == G.vexs[i])
			break;
	}
	cout << endl;
	while (i >= G.vexnum) {
		cout << "該點不存在，請重新輸入！" << endl;
		cout << "請輸入遍歷連通圖的起始點：";
		cin >> c;
		for (i = 0;i < G.vexnum;++i) {
			if (c == G.vexs[i]) {
				break;
			}
		}
	}
	cout << "深度優先搜索遍歷連通圖結果：" << endl;
	DFS(G, i);

	cout << endl;
	return 0;
}