Research on the Best Method of Shortest Path to Solve Network Communication Problem

作     者：Wen-rong JIANG Tao-zi SI 

作者单位：School of Computer and Information Shanghai Polytechnic University 

会议日期：2019年

学科分类：07[理学] 08[工学] 070104[理学-应用数学] 0701[理学-数学] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the Key Disciplines of Computer Science and Technology of Shanghai Polytechnic University under Grant No. XXKZD1604 

关 键 词：Dijkstra algorithm Shortest path Network communication Research Graph theory 

摘      要：As the basic theory of shortest path calculation, Dijkstra algorithm is widely used in various aspects, such as: transportation, construction of signal station, laying of high-speed rail. Based on graph theory, this paper studies Dijkstra algorithm to analyze network communication problems, introduces the principle of Dijkstra algorithm in detail, and makes a contribution to the research of shortest path.