中文摘要：

文章通过对现代交通问题的分析,研究了一种基于两点之间有连接概率的网络最短路模型。基于对节点的连接概率和边的权值两方面综合考虑,提出了一种寻找最短路的算法。此算法应用标号法的思想,对标号法中的迭代过程加以改进,把接点的连接概率和边的权值同时加以考虑,进行计算。最后,通过实例验证了此算法的可行性和有效性。

英文摘要：

This paper, through the analysis of modern traffic problem, a shortest path problem based on stochastic connection between two points is studied. In consideration of the connective probability between two points and weight of edges, an algorithm to solve the problem is proposed. By using the idea of floyed, iterative process of the algorithm is improved, the shortest path considering the connective probability between twopoints and weight of edges is computed. Finally, analysis on the example indicates that the algorithm is feasible and effective.