学术
摘 要:
通过对满足一定条件的强连通有向图进行d阶段化，来改进其网络模型．其中，d为强连通有向图的周期．针对该模型，给出任意一点到其他点的最短距离算法以及其最小有向H圈长，并且用C＋＋对两个算法进行仿真实验。证明了算法的可行性．[著者文摘]
文章出处:
《天津工业大学学报》-2007年26卷5期 -80-82页
栏目信息:
分 类 号:
文献标识码:
A
文章编号:
1671-024X（2007）05-0080-03
Research and application of strongly connected directed digraph with period
WU Jing, WANG Peng-tao, WEI Guo-li （School of Computer Science and Technology, Tianjin University of Technology, Tianjin 300191, China）
Abstract:
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.[著者文摘]
Key words:
strongly connected directed digraph; directed H circle; period; staging
基金资助:
天津自然科学基金资助项目（043600511）;天津市教委自然科学基金资助项目（20030618）
更多>>免费文章
cqvip.com