The Research On The Shortest Path Algorithm For The Specified Node

At present,the shortest path problem is one of the basic problems in various fields,including applied mathematics,computer science,engineering,management,and computing,It is a hot issue that many scholars at home and abroad pay close attention to.Network model is a kind of effective method,which simulates the real world problems,and is widely used in many different types of systems,information and communication,machinery,electronics,manufacturing and logistics,etc.The traditional shortest path problem is to solve the shortest path between two points,and can be calculated by a simple algorithm.For example,Dijkstra algorithm,Floyd algorithm,Bellman_Ford algorithm and so on.However,in practical applications,there are more complicated problems,such as complex structure,complex constraints,and multiple objectives simultaneously processing.So the traditional solution to the shortest path problem can not meet the needs of people.If the model is large,or there are many points in the middle must go through,and the requirements in a short time to find such a shortest path,then the problem becomes complicated.In this paper,we mainly study the shortest path problem for graphs with different sizes and the number of points.In the light of different problems,a different solution to the shortest path algorithm was designed,then the flow of the algorithm was given.Finally,the corresponding examples are calculated and analyzed according to different algorithms,and the applicability of the model and algorithm was verified.Its main work is as follows:1.Research and analysis on the shortest path problem of small scale graph,put forward a depth traversal exhaustive algorithm,and compare the advantages and disadvantages of other traditional algorithms.Then,the calculation and comparison are carried out by using the corresponding examples.2.Research and analysis on the shortest path problem of the medium size map,put forward a algorithm that reduce the size of figure firstly and then depth traversal.And compares the advantages and disadvantages of the overall depth traversal algorithm.Then,the calculation and comparison are carried out by using the corresponding examples.3.Research and analysis on the shortest path problem of large scale map,an improved genetic algorithm is proposed.And compare the advantages and disadvantages of other algorithms.Then,using the corresponding examples to calculate and compare.In the reading articles,most of them are based on a model.This paper give the calculation and analysis of different algorithms,it has great theoretical and practical significance.