文件名称:tuDeBianLi
介绍说明--下载内容均来自于网络,请自行研究使用
以邻接表为存储结构,选择图的类型(有向图或无向图),创建相应的图。对创建的图按深度优先和广度优先的遍历。(文档中含代码)
-To the adjacent table for the storage structure, select the type of graph (directed graph or undirected graph), create a corresponding map. To create the graph by depth-first and breadth-first traversal. (The document containing the code)
-To the adjacent table for the storage structure, select the type of graph (directed graph or undirected graph), create a corresponding map. To create the graph by depth-first and breadth-first traversal. (The document containing the code)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
tuDeBianLi.doc