Search - adjacency list graph

Search - adjacency list graph - List

[Other resource] Diagram DL : 0: 图的操作,包括,图的基本存储方法,有关图的操作算法并用C语言编程实现,图的搜索路径的遍历方法,以邻接矩阵和邻接表的方式存储连通图。然后分别用优先深度算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。深度优先遍历的递归算法（1）深度优先遍历算法（2）邻接表表示的深度优先搜索算法（3）邻接矩阵表示的深度优先搜索算法.-plan of operation, including, map the basic storage methods, the operation of the map algorithm and C language programming. map of the search path traversal methods to the adjacency matrix and adjacency list of storage connected graph. Then, using the priority traversal algorithm depth of the matrix adjacent to the storage map and the adjacent forms storage plans. Depth-first traversal of the recursive algorithm (1) depth-first traversal algorithm (2) adjoining table depth-first search algorithm ( 3) adjacency matrix of depth-first search algorithm.
Date : 2008-10-13 Size : 1.46kb User : 林静