| Floyd算法的一个通用程序及在图论中的应用 |
| |
| 引用本文： | 周炳生.Floyd算法的一个通用程序及在图论中的应用[J].浙江科技学院学报,1999(3). |
| |
| 作者姓名： | 周炳生 |
| |
| 作者单位： | 杭州应用工程技术学院信电系!杭州310012 |
| |
| 摘 要： | 给出了图结构中Floyd算法的一个通用程序，并应用该程序提出了图的许多重要性质的充分必要判别条件和图论中若干重要问题的不同于传统的新解法．提出的实现动态数组的思想对设计以多维数组为参数的通用程序具有普遍意义．
|
| 关 键 词： | Floyd算法 动态数组 最短路径 广度优先遍历 连通性 关节点 |
A general program of Floyd's algorithm and its application in graph theory |
| |
| Zhou Bingsheng.A general program of Floyd's algorithm and its application in graph theory[J].Journal of Zhejiang University of Science and Technology,1999(3). |
| |
| Authors: | Zhou Bingsheng |
| |
| Abstract: | In this paper a eneral program of Floyd's algorithm in gragh structure is given, on support of which necesary and sufficient testing conditions for a lot of important characteristics of graphs are presented,and new methods differ rrom tradition for solving some important problems in graph theory are given.The presented idea in this paper for implementation of dynamic array shall be of universal significance for programming with multiple array as parameter. |
| |
| Keywords: | Floyd's algorithm dynamic array shortest path breadth-first search connection articulation point |
| 本文献已被 CNKI 等数据库收录！ |
