Research on K Shortest Avoid Disaster Path During Mine Fire Period

During fire period under the coal mine, varieties of toxic or harmful gases will seriously affect the life and property safety of the miners, so the miners should flee to safety site in the shortest time at the beginning of the fire. Based on this thought, this paper expounds the method of getting optimum path in undirected graph with right based on the Dijkstra algorithm, and puts forward the new method of K shortest path. Then combining with mine specific examples, using VB programming language, this paper provides possibility to get the two routes quickly and accurately.