图的深度优先遍历算法及运用

The DFS for Graph and its Application

简要介绍图的深度优先遍历算法,通过对由易到难、层次不一的题目进行分析求解,深化对该算法的理解,理清算法学习的思路,并试着展示数据结构学习过程中的一种模式。

This paper briefly introduces the DFS for graph,and deepen your interpretation of this algorithm,give you an easy access to algorithm-study by analizing some example.Then,I want to construct a model for Datastructure-learning.