文件名称:tu
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
键盘输入数据，建立一个有向图的邻接表。
（2）输出该邻接表。
（3）建立一个无向图的十字链表。
（4）在有向图的邻接表的基础上计算各顶点的度，并输出。
（5）采用邻接表存储实现无向图的深度优先遍历。。
（6）采用邻接表存储实现无向图的广度优先遍历。
-Keyboard input data, the establishment of a directed graph of the adjacency list. (2) the output of the adjacent table. (3) the establishment of an undirected graph of the cross list. (4) in the directed graph adjacency list based on the calculation of the vertex degrees, and outputs. (5) the use of adjacency list undirected graph storage to achieve the depth-first traversal. . (6) using adjacency list undirected graph storage to achieve the breadth-first traversal.
（2）输出该邻接表。
（3）建立一个无向图的十字链表。
（4）在有向图的邻接表的基础上计算各顶点的度，并输出。
（5）采用邻接表存储实现无向图的深度优先遍历。。
（6）采用邻接表存储实现无向图的广度优先遍历。
-Keyboard input data, the establishment of a directed graph of the adjacency list. (2) the output of the adjacent table. (3) the establishment of an undirected graph of the cross list. (4) in the directed graph adjacency list based on the calculation of the vertex degrees, and outputs. (5) the use of adjacency list undirected graph storage to achieve the depth-first traversal. . (6) using adjacency list undirected graph storage to achieve the breadth-first traversal.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
tu.cpp