本科毕业论文--图的深度优先遍历及应用.docVIP

本科毕业论文（设计） 学 号： 学 生 姓 名： 摘要 图是一个最基本、最有表现力的结构，可以用于表示具有各种复杂关系的数据集合，在实际应用中无处不在。虽然问题的状态可以用图来表示，但问题的求解则往往是从状态图中寻找某个状态，或是寻找从一个状态到另一个状态的路径。实现这一求解的过程需要逐步探索与问题有关的各种状态，这即是搜索。这里我们将讨论基于深度优先搜索图的算法，以及该算法的一些相关性质，主要包括：括号定理、后裔区间的嵌套性质和白色路径性质，和由此引出的对边的分类。并给出其应用：一方面是作为基础应用于求无向图中连通分量的个数和求解无向图中通过给定顶点V的简单回路的算法中；另一方面是对基于DFS 的图的双向连通性的判断。 关键词 深度优先遍历；连通分量；简单回路；挂接点 Abstract Graphs is the most basic and performance data structure in computer science, it can used for meaning that the data that have various complicated relation gathers, and algorithms for working with them are fundamental to the field. Although the status of problem can be meant with Graphs,the solving of problem then usually looks for a certain status from the state graph,or looks for from a path that the status arrives another status.Carry out this various status that the process solving needs to gradually investigate to have something to do with problem,this is to search. Here we discuss algorithms based on searching a graph using depth-first search, as well as some connected property, including Parenthesis theorem、Nesting of descendants’ intervals、White-path theorem and Classification of edges derived from these.Some applications are also given: One is as foundation applied to found the number of connected components in no directed graph; the other hand is to according to the double of DFS graph to connect sexual judgment. Key words DFS(Depth First Search); connected components; simple back track; atrpoint 目录 绪论……………………………………………………………………………1 深度优先遍历算法的思想及算法…………………………………………1 深度优先遍历算法的性质…………………………………………………2 2.1.括号性质及其相应性质…………………………………………………2 2.2.边的分类…………………………………………………………………4 深度优先遍历算法的应用………………………………………………4 3.1.作为基础应用在其他算法中………………………………………4 3.1.1.求无向图中连通分量的个数……………………………4 3.1.2. 求解无向图中通过给定顶点V的简单回路……………………………4 3.2. 基于DFS 的图的双向连通性的判断…………………………………………5 3.2.1.基本概念……………………………………………………………………5 3.2.2. 图的双向连通性判断的理论基础…………………………………………5 3.2.3. 图的双向连通性判断方法及实现…………………………………………6 3.2.4. 查找挂接点的DFS 动态树示例……………………………………………7