Research and design of an intelligent searching algorithm

As the shortest path denotes one path, algorithms designed for shortest path problem can get only one path. Based on Dijkstra's shortest path algorithm, an intelligent algorithm for state space searching for K shortest path. is presented with the aid of the thoughts of state space searching and dynamic cut branch in artificial intelligence. The intelligent algorithm can optimize searching path, reduce searching scope, raise searching speed, and can be applied to solve K shortest paths in multi-graphs. Furthermore, K shortest paths are K paths including the shortest one, the secondary shortest one, and so on, and it can meet the needs of actual application. The complexity analysis and the instances of this algorithm show that the intelligent algorithm is applicable to improve the efficiency in spatial analysis of the net system.