【摘要】 通过对满足一定条件的强连通有向图进行d阶段化,来改进其网络模型.其中,d为强连通有向图的周期.针对该模型,给出任意一点到其他点的最短距离算法以及其最小有向H圈长,并且用C++对两个算法进行仿真实验,证明了算法的可行性.更多还原

【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 algorithm of calculating the optimization route of two arbitrary nodes is designed. Besides, an algorithm of calculating 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.更多还原