| 可达矩阵的Warshall算法实现 |
| |
| 引用本文： | 叶红. 可达矩阵的Warshall算法实现[J]. 安徽大学学报(自然科学版), 2011, 35(4) |
| |
| 作者姓名： | 叶红 |
| |
| 作者单位： | 安徽工业大学计算机学院,安徽马鞍山,243000 |
| |
| 基金项目： | 安徽省教育厅自然科学基金资助项目(KJ2008B105) |
| |
| 摘 要： | 通过图的矩阵表示可以得到图的很多重要性质,将邻接矩阵看作图的结点集的关系矩阵,由此可以产生可达矩阵,从而可以反映图中各结点间是否有路.可达矩阵可用W arshall算法求得,作者用VB实现了该算法.
|
| 关 键 词： | 图的矩阵 邻接矩阵 Warshall算法 VB 可达矩阵 |
Reach ability matrix by Warshall algoritma |
| |
| YE Hong. Reach ability matrix by Warshall algoritma[J]. Journal of Anhui University(Natural Sciences), 2011, 35(4) |
| |
| Authors: | YE Hong |
| |
| Affiliation: | YE Hong(School of Computer,Anhui University of Technology,Maanshan 243000,China) |
| |
| 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. |
| |
| Keywords: | graph matrix adjacency matrix Warshall Algorithm VB reachability matrix |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
