图论中的最短路径问题  

Shortest Path Problem in Graph Theory

作　　者：许茵[1] 边馥萍[2] XU Yin;BIAN Fuping(Department of Science,Tianjin University of Technology and Education,Tianjin 300222,China;Department of Science,Tianjin University,Tianjin 300350,China)

机构地区：[1]天津职业技术师范大学理学院,天津300222 [2]天津大学理学院,天津300350

出　　处：《数学建模及其应用》2024年第4期105-110,共6页Mathematical Modeling and Its Applications

摘　　要：图论这门古老的学科,历史可以追溯到几个世纪以前.随着计算机科学的兴起,图论理论和计算机实践相结合,图论算法的研究引起了越来越多的兴趣.计算机科学家迪克斯特拉、弗洛伊德等提出了最短路径算法.最短路径问题把实际问题抽象成图,结合组合优化思想,广泛应用在计算机科学、通信工程、系统工程、信息论、控制理论和社交网络分析等领域.As an ancient discipline,graph theory can be traced back centuries.With the rise of computers,the combination of graph theory and computer science has sparked increasing interest in the study of graph theory algorithms.Computer scientists Dijkstra and Floyd discovered shortest path algorithm.The shortest path problem abstracts practical problems into graphs and combines combinatorial optimization ideas,widely used in fields such as computer science,communication engineering,systems engineering,information theory,control theory,and social network analysis.

关 键 词：图论 迪克斯特拉算法 弗洛伊德算法 社交网络分析 

分 类 号：O29[理学—应用数学]