摘要
《数据结构》课程是计算机和信息管理等相关专业的一门核心课程,图是一种较线性表和树更为复杂的数据结构。相对于线性表中数据元素之间的线性关系与树形结果中数据元素之间的层次关系,图形结构中结点之间的关系可以是任意的,图中的任意两个数据元素之间都可能相关。本设计是编写关于图的建立以及输出,使用顺序存储结构建立有向图和无向图,输出图的邻接矩阵以及图的深度优先和广度优先遍历次序。
Abstract
"Data Structure" course computer and information management, and other related professionals in a core curriculum, A map is a more linear tables and trees more complex data structure. Linear relation to the table data elements linear relationship between the tree and the results of data elements between the level of relations, Graphics node structure of the relationship between can be arbitrary, random map data elements between the two may be related.
The design is the preparation of plans and the establishment of export, the use of storage structure order to establish a map and undirected graph, Output of adjacency matrix and map the depth and breadth of priority traversal sequence.