摘要
给出了图结构中Floyd算法的一个通用程序，并应用该程序提出了图的许多重要性质的充分必要判别条件和图论中若干重要问题的不同于传统的新解法．提出的实现动态数组的思想对设计以多维数组为参数的通用程序具有普遍意义．
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.
出处
《杭州应用工程技术学院学报》
1999年第3期1-9,共9页
Journal of Hangzhou Institute of Applied Engineering
关键词
FLOYD算法
图论
充分必要条件
连通性
关节点
Floyd's algorithm dynamic array shortest path breadth-first search connection articulation point
