论文部分内容阅读
针对矿井通风网络解算过程中最小生成树的生成过程采用传统的“破圈法”计算时间长的问题,提出应用贪心算法解算通风网络,以期缩短计算时间,提高程序运行速度。
Aiming at the problem that the traditional sparse circle method is used to calculate the minimum spanning tree in the process of solving the mine ventilation network, a greedy algorithm is proposed to solve the problem of the ventilation network in order to shorten the calculation time and improve the running speed of the program.