Algorithm of Route Searching for Mine Geographic Network

According to the features of mine geographic network, the paper presents an algorithm of route searching for mine geographic network called tree growth. This algorithm can improve the searching efficiency for avoiding searching for the intersection part of the routes. If the node of the subsequent growing branch is the same as any element of the intersection namely node (or called meeting with a refusal), it will immediately change the direction. The tree growth algorithm can avoid the problem of searching combination explosion and is applicable to route searching for large-scale mine.