文件名称:Handout
介绍说明－－下载内容均来自于网络，请自行研究使用
创建图的邻接表存储结构,输出邻接表数据(验证创建过程),深度优先遍历(DFS) ,广度优先遍历(BFS),增加一个顶点到图, 删除一个顶点(同时删除其所有邻接边) ,增加一条弧到图,从图中删除一条弧-
Creating adjacency table storage structure, the output adjacency table data (validation creation process), depth-first traversal (DFS), breadth-first traversal (BFS), add a vertex to the graph, deleting a vertex (also delete all of its adjacent edges), increase an arc to the map, from the figure delete an arc
Creating adjacency table storage structure, the output adjacency table data (validation creation process), depth-first traversal (DFS), breadth-first traversal (BFS), add a vertex to the graph, deleting a vertex (also delete all of its adjacent edges), increase an arc to the map, from the figure delete an arc
(系统自动生成,下载前可以参看下载内容)
下载文件列表
g.dat
实验06-图（文件输入图） .cpp