安徽大学学报（自然科学版）2011，Vol.35Issue(4)：31-35,5.
可达矩阵的Warshall算法实现
Reach ability matrix by Warshall algoritma
摘要
Abstract
A lot of important properties of graphs can be indicated by matrix through the graph , when adjacency matrix of the graph node set was regarded as the relationship matrix, the matrix could generate which could reflect the graph between the nodes if there were roads. Matrix could be obtained by Warshall algorithm. In this paper, the algorithm implemented VB.关键词
图的矩阵/邻接矩阵/Warshall算法/VB/可达矩阵Key words
graph matrix, adjacency matrix, Warshall Algorithm, VB, reachability matrix分类
信息技术与安全科学引用本文复制引用
叶红..可达矩阵的Warshall算法实现[J].安徽大学学报（自然科学版）,2011,35(4):31-35,5.基金项目
安徽省教育厅自然科学基金资助项目(KJ2008B105) （KJ2008B105）
