文件名称:aaa
介绍说明--下载内容均来自于网络,请自行研究使用
对任意给定的图(顶点数不小于20,边数不少于30,图的类型可以是有向图、无向图、有向网、无向网),能够输入图的顶点和边(或弧)的信息,并存储到相应存储结构(邻接矩阵、邻接表、十字链表、邻接多重表,任选其中两种类型),对自己所创建的图完成以下操作:
对无向图求每个顶点的度,或对有向图求每个顶点的入度和出度(5分)
完成插入顶点和边(或弧)的功能(5分)
完成删除顶点和边(或弧)的功能(5分)
两种存储结构的转换(5分),如果其中一种存储结构为十字链表或邻接多重表则增加5分。
输出图的深度优先遍历序列或广度优先遍历序列(5分)
求图的深度优先或广度优先的生成树(或生成森林)(存储结构为孩子-兄弟链表),并对生成树进行遍历(15分)
判断图的连通性,输出连通分量的个数(5分)
判断图中是否存在环,无向图5分,有向图10分
给出顶点u和v,判断u到v是否存在路径(5分)
10、求顶点u到v的一条简单路径(10分)
11、求顶点u到v的所有简单路径(15分)
12、求顶点u到v的最短路径(10分)
13、求顶点u到其余各顶点的最短路径(15分)
14、求任两个顶点之间的最短路径(15分)
15、求最小生成树(15分)
-On any given plan (not less than 20 vertices, edges not less than 30, the type of plan can be a directed graph, undirected graph, the network, not the network), can enter the vertex and edge (or arc) of the information, and stored in the corresponding storage structure (adjacency matrix, adjacency table, cross linked, adjacent to multiple tables, in which two types optional), created their own plan to complete the following:
Undirected graph on each vertex of degree requirements, or request a directed graph each vertex-degree and out-degree (5 points)
Complete the insertion of vertices and edges (or arcs) of the function (5 points)
Complete deletion of vertices and edges (or arcs) of the function (5 points)
The conversion of two storage structures (5 points), if one of the storage structure for the cross-linked or adjacent multi-table is an increase of 5 points.
Depth-first traversal output graph breadth-first traversal sequences or sequence (5 points)
Graph of the depth-fi
对无向图求每个顶点的度,或对有向图求每个顶点的入度和出度(5分)
完成插入顶点和边(或弧)的功能(5分)
完成删除顶点和边(或弧)的功能(5分)
两种存储结构的转换(5分),如果其中一种存储结构为十字链表或邻接多重表则增加5分。
输出图的深度优先遍历序列或广度优先遍历序列(5分)
求图的深度优先或广度优先的生成树(或生成森林)(存储结构为孩子-兄弟链表),并对生成树进行遍历(15分)
判断图的连通性,输出连通分量的个数(5分)
判断图中是否存在环,无向图5分,有向图10分
给出顶点u和v,判断u到v是否存在路径(5分)
10、求顶点u到v的一条简单路径(10分)
11、求顶点u到v的所有简单路径(15分)
12、求顶点u到v的最短路径(10分)
13、求顶点u到其余各顶点的最短路径(15分)
14、求任两个顶点之间的最短路径(15分)
15、求最小生成树(15分)
-On any given plan (not less than 20 vertices, edges not less than 30, the type of plan can be a directed graph, undirected graph, the network, not the network), can enter the vertex and edge (or arc) of the information, and stored in the corresponding storage structure (adjacency matrix, adjacency table, cross linked, adjacent to multiple tables, in which two types optional), created their own plan to complete the following:
Undirected graph on each vertex of degree requirements, or request a directed graph each vertex-degree and out-degree (5 points)
Complete the insertion of vertices and edges (or arcs) of the function (5 points)
Complete deletion of vertices and edges (or arcs) of the function (5 points)
The conversion of two storage structures (5 points), if one of the storage structure for the cross-linked or adjacent multi-table is an increase of 5 points.
Depth-first traversal output graph breadth-first traversal sequences or sequence (5 points)
Graph of the depth-fi
(系统自动生成,下载前可以参看下载内容)
下载文件列表
aaa.cpp