文章通过对现代交通问题的分析,研究了一种基于两点之间有连接概率的网络最短路模型。基于对节点的连接概率和边的权值两方面综合考虑,提出了一种寻找最短路的算法。此算法应用标号法的思想,对标号法中的迭代过程加以改进,把接点的连接概率和边的权值同时加以考虑,进行计算。最后,通过实例验证了此算法的可行性和有效性。 Based on the analysis of modern traffic problems, the paper studies a network shortest path model based on the connection probability between two points. Based on the consideration of the connection probability and the weight of the edge, a new algorithm to find the shortest path is proposed. This algorithm applies the idea of ​​label method to improve the iterative process in the label method, taking the connection probability and the weight of the edge into consideration simultaneously. Finally, an example is given to verify the feasibility and effectiveness of this algorithm.