Traversing Gragh Algorithm in Data Structure

This article according to the difference of method in storage structure of graph、search path and design algorithm is to introduce eight different kinds of traversing graph algorithm in detail. That is to say: from two different storage structure of adjacency matrix and adjacency list and two kinds of difference traversing graph algorithm include recursion and not recursion, depth precedence search and breadth precedence search are divided into four kinds of different traversing graph algorithm. This paper is to make beginners and college students master different traversing grasp algorithm well and write out all kinds of graph traversing programs exactly.