| 邻接矩阵的初始化问题研究 |
| |
| 引用本文： | 魏少涵. 邻接矩阵的初始化问题研究[J]. 新余高专学报, 2012, 17(6): 73-75 |
| |
| 作者姓名： | 魏少涵 |
| |
| 作者单位： | 福州海峡职业技术学院计算机通信工程系,福建福州350014 福建工程学院国脉信息学院计算机与信息科学系,福建福州350014 |
| |
| 摘 要： | 图的应用问题的求解前提是图的模型的创建，而图在计算机中的存储方式是各类算法的使用前提。用二维数组表示的邻接矩阵来存储图，是常用的方式。在此基础上，探讨了拓扑排序、最短路径及状态转换问题的图的邻接矩阵的初始化问题。
|
| 关 键 词： | 邻接矩阵 初始化 图 拓扑排序 最短路径 |
Research on the initialization of adjacency matrix |
| |
| Affiliation: | WEI Shao - han( 1. Fuzhou Strait Vocational ＆ Technical College, Fuzhou 350014 China; 2. Fujian University of Technology, Fuzhou 350014 China) |
| |
| Abstract: | The creation of graph model is the basis of many problems, and the way of storing a graph is the precondition of every algo- rithm. Adjacency matrix, in the form of two - dimensional array, is one of the popular methods of storing a graph. On this basis, the initialization of adjacency matrix is discussed in the following situations ： topological sort, shortest path and status changing. |
| |
| Keywords: | adjacency matrix initialization graph topological sort shortest path |
| 本文献已被 维普 万方数据 等数据库收录！ |
