有向图的扩展邻接矩阵存储模式研究  

STUDY OF THE EXTENDED ADJACENCY MATRIX REPRESENTATION OF A DIRECTED GRAPH

作　　者：邓长寿[1] 任红卫[1] 

机构地区：[1]九江学院信息科学与技术学院,江西九江332005

出　　处：《九江学院学报（社会科学版）》2007年第3期1-4,共4页Journal of Jiujiang University：Social Science Edition

摘　　要：本文对于有向图的存储模式进行了研究。在邻接矩阵和邻接表的基础之上,提出了一种新的有向图存储结构-扩展邻接矩阵,并研究了建立该矩阵的算法。扩展邻接矩阵存储模式同时具有邻接矩阵、邻接表和十字链表三种传统存储结构分别可以快速从有向图获得不同信息的优点。扩展邻接矩阵为有向图的应用,提供了一种高效的存储方案。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.

关 键 词：有向图 邻接矩阵 邻接表 扩展邻接矩阵 

分 类 号：TP27[自动化与计算机技术—检测技术与自动化装置]