文件名称:Graph
介绍说明－－下载内容均来自于网络，请自行研究使用
1．建立无向网的邻接矩阵。
要求：从键盘输入无向网的顶点数和边数；然后以“顶点1，顶点2，权值”的方式输入图的各边，建立邻接矩阵存储，并输出各顶点和邻接矩阵。
2．对无向网进行深度优先遍历，输出遍历序列。
3.判断给定的无向网是否是连通的？
要求：从键盘上输入出发点进行搜索遍历，输出遍历序列。
-1. The establishment of the network adjacency matrix.
Requirements: No input from the keyboard to the network, the number of vertices and edges and then, "vertex 1, vertex 2, the right value" means input graph on all sides, the establishment of the adjacency matrix storage, and output of all vertices and adjacency matrix.
2. To the nets for non-depth-first traversal, the output traversal sequence.
3. To determine a given undirected network whether it is connected?
Requirements: from the keyboard to enter a starting point to search traversal, the output traversal sequence.
要求：从键盘输入无向网的顶点数和边数；然后以“顶点1，顶点2，权值”的方式输入图的各边，建立邻接矩阵存储，并输出各顶点和邻接矩阵。
2．对无向网进行深度优先遍历，输出遍历序列。
3.判断给定的无向网是否是连通的？
要求：从键盘上输入出发点进行搜索遍历，输出遍历序列。
-1. The establishment of the network adjacency matrix.
Requirements: No input from the keyboard to the network, the number of vertices and edges and then, "vertex 1, vertex 2, the right value" means input graph on all sides, the establishment of the adjacency matrix storage, and output of all vertices and adjacency matrix.
2. To the nets for non-depth-first traversal, the output traversal sequence.
3. To determine a given undirected network whether it is connected?
Requirements: from the keyboard to enter a starting point to search traversal, the output traversal sequence.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Graph\邻接矩阵1.cpp
Graph
Graph