1.完整代码

#include<iostream>
using namespace std;#define OK 		1
#define ERROR 	0
#define MaxInt 	0		
#define MVNum 	100			//最大顶点数
#define Max 	20
typedef char VerTexType;	//顶点的数据类型为字符型 
typedef int ArcType; 		//权值类型为整形
typedef int Status;typedef struct{VerTexType vexs[MVNum];			//顶点表 ArcType arcs[MVNum][MVNum];		//邻接矩阵 int vexnum, arcnum;				//图的当前点数和边数 
}AMGraph;	//Adjacency Matrix Graph /****************************图的创建*******************************/ 
//在图G中查找顶点u，存在则返回顶点表中的下标i 
Status LocateVex(AMGraph G, VerTexType u)
{for(int i = 0; i < G.vexnum; ++i){if( u == G.vexs[i] )return i;}
}//采用邻接矩阵表示法，创建无向图G 
//算法思想：
//	1.输入总顶点和总边数
//	2.依次输入点的信息存于顶点表中
//	3.初始化邻接矩阵，如果是无向图图，初始化为0，如果是无向网，则初始化为极大值
//	4.构造邻接举证 
Status CreatUDN(AMGraph &G)
{VerTexType v1, v2;int w;cout << "输入总顶点数: " << endl;cin >> G.vexnum;cout << "输入总边数: "<< endl;	cin >> G.arcnum;					//输入总顶点数，总边数cout << "请输入所有顶点：" << endl;for(int i = 0; i < G.vexnum; ++i){cin >> G.vexs[i];				//依次输入顶点的信息 }for(int i = 0; i < G.vexnum; ++i)	//初始化邻接矩阵 {for(int j = 0; j < G.vexnum; ++j){G.arcs[i][j] = MaxInt;		//边的权值均置为极大值 }}cout << "分别输入一条边依附的两个顶点和权值：" << endl;for(int k = 0; k < G.arcnum; ++k){cin >> v1 >> v2 >> w;int m = LocateVex(G, v1);int n = LocateVex(G, v2);G.arcs[m][n] = w;					 G.arcs[n][m] = w;				//(如果是有向图，则不需要给G.arcs[n][m]赋值)}return OK;
}/****************************图的打印和遍历*******************************/ 
//打印图的顶点 
void PrintVex(AMGraph G)
{cout << "  ";for (int i = 0;i < G.vexnum;i++){cout << G.vexs[i] << " ";}cout << endl;
}//打印图的边 
void PrintEdge(AMGraph G)
{for (int i = 0;i < G.vexnum;i++){cout << G.vexs[i] << " "; for (int j = 0;j < G.vexnum;j++){cout << G.arcs[i][j] << " ";}cout << endl;}
}//深度优先遍历 
bool visited[Max];					//定义布尔型数组作为标记数组 
void DFS(AMGraph G, int v)
{cout << G.vexs[v];				//访问第v个结点 visited[v] = true;for(int w = 0; w < G.vexnum; w++){if( (G.arcs[v][w] != 0) && (!visited[w]) ){cout << "->";DFS(G, w);				//对v的尚未访问的邻接顶点w递归调用DFS }}
}void DFSTraverse(AMGraph G)
{for (int i = 0;i < Max;i++)			//初始化访问标记数组{visited[i] = false;}for (int i = 0;i < G.vexnum;i++)	//对每个连通分量进行遍历{if (!visited[i])				{DFS(G, i);					//对尚未访问的顶点调用DFS cout << endl;}}
}/****************************主函数*******************************/ 
int main()
{AMGraph G;CreatUDN(G);cout << "创建的图为：" << endl;PrintVex(G);PrintEdge(G);cout << "深度遍历顺序为：" << endl;	DFSTraverse(G);cout << endl;return 0;
}

2.测试结果