| 有向图的扩展邻接矩阵存储模式研究 |
| |
| 引用本文： | 邓长寿,任红卫. 有向图的扩展邻接矩阵存储模式研究[J]. 九江学院学报, 2007, 26(3): 1-4 |
| |
| 作者姓名： | 邓长寿 任红卫 |
| |
| 作者单位： | 九江学院信息科学与技术学院,江西九江,332005;九江学院信息科学与技术学院,江西九江,332005 |
| |
| 摘 要： | 本文对于有向图的存储模式进行了研究。在邻接矩阵和邻接表的基础之上,提出了一种新的有向图存储结构-扩展邻接矩阵,并研究了建立该矩阵的算法。扩展邻接矩阵存储模式同时具有邻接矩阵、邻接表和十字链表三种传统存储结构分别可以快速从有向图获得不同信息的优点。扩展邻接矩阵为有向图的应用,提供了一种高效的存储方案。
|
| 关 键 词： | 有向图 邻接矩阵 邻接表 扩展邻接矩阵 |
| 文章编号： | 1673-4580(2007)03-0001-(04) |
| 修稿时间： | 2007-03-12 |
STUDY OF THE EXTENDED ADJACENCY MATRIX REPRESENTATION OF A DIRECTED GRAPH |
| |
| DENG Chang-shou,REN Hong-wei. STUDY OF THE EXTENDED ADJACENCY MATRIX REPRESENTATION OF A DIRECTED GRAPH[J]. JOurnal of Jiujiang University(Social Science Edition), 2007, 26(3): 1-4 |
| |
| Authors: | DENG Chang-shou REN Hong-wei |
| |
| Abstract: | This paper focuses on the internal representation of a directed graph.A novel approach,Extended Adjacency Matrix representation,to internally represent graph structure is proposed which combines adjacency matrix with adjacency list and orthogonal list allowing for the fastest possible access to different types of information on a directed graph.It is an efficient representation for the application of a directed graph. |
| |
| Keywords: | Directed Graph Adjacency matrix Adjacency list Extended Adjacency Matrix |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
