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.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700