文件名称:shengdubianli
介绍说明－－下载内容均来自于网络，请自行研究使用
1.首先选定图的类别（有向图、无向图），再选定图的存储结构，根据输入的顶点或者边建立图；并把相应的邻接表或者邻接矩阵输出；
2.根据已有的邻接矩阵或邻接表用递归方法编写深度优先搜索遍历算法，并输出遍历结果；
-1. First of all selected map type (directed graph, undirected graph), re-selected map storage structure, under the Importation of the establishment of the vertex or edge map and the corresponding adjacency list or adjacency matrix output 2. According to Some adjacency matrix or adjacency list prepared by the recursive depth-first search method traversal algorithm, and output traversal results
2.根据已有的邻接矩阵或邻接表用递归方法编写深度优先搜索遍历算法，并输出遍历结果；
-1. First of all selected map type (directed graph, undirected graph), re-selected map storage structure, under the Importation of the establishment of the vertex or edge map and the corresponding adjacency list or adjacency matrix output 2. According to Some adjacency matrix or adjacency list prepared by the recursive depth-first search method traversal algorithm, and output traversal results
(系统自动生成,下载前可以参看下载内容)
下载文件列表
shengdubianli.cpp