摘要
通过对满足一定条件的强连通有向图进行d阶段化,来改进其网络模型.其中,d为强连通有向图的周期.针对该模型,给出任意一点到其他点的最短距离算法以及其最小有向H圈长,并且用C++对两个算法进行仿真实验,证明了算法的可行性.
The model of strongly connected directed diagraph under certain conditions is optimized by making the digraph stage. And, is the period of the strongly connected directed digraph. Based on this model, the algo- rithm of calculating the optimization route of two arbitrary nodes is designed, Besides, an algorithm of calcu lating the shortest length of directed H circleis presented. In the end, an example is given to show the feasibility of the two algorithms. This research can be the theoretical base for the logistic optimization of city with lane.
出处
《天津工业大学学报》
CAS
2007年第5期80-82,共3页
Journal of Tiangong University
基金
天津自然科学基金资助项目(043600511)
天津市教委自然科学基金资助项目(20030618)
关键词
强连通有向图
有向H圈
周期
阶段化
strongly connected directed digraph
directed H circle
period
staging
