Using Multi-Thread Technology Realize Most Short-Path Parallel Algorithm

With the development of computer, the graph theory research obtains widely takes, and the most short-path question as a model question of graph theory is already applied in many fields. Because the efficiency of the existing most short-path serial algorithm is not very high, and it is already with difficulty in satisfying the need in modern. Therefore, this paper proposes a new most short-path parallel algorithm, and has carried on it using the multi-thread technology.