节点分层法求解通风网络中的所有通路

Node delamination for all paths in ventilation network

针对目前通风网络所有通路搜索算法效率较低的问题,提出节点分层法.通过节点分层和层间分支拼接求解所有通路,避免了频繁的后退操作,提高了算法效率.根据节点分层法和现有通路搜索方法开发了算法效率测试软件,并对不同规模的通风网络进行所有通路搜索效率对比测试.研究结果表明:节点分层法搜索效率随着网络规模增大而提高;对于1 010条分支的通风网络,节点分层法较深度优先搜索法提高41.59%.该方法适合大规模通风网络所有通路的快速求解.

Aiming at the low efficiency of traditional algorithm which is used to search all the paths of ventilation network, node layering method is proposed. By node delamination and layer branch connection, this algorithm avoids the frequent back operation and improves the efficiency. The test software was developed based on three kinds of path searching method. The comparison test of the efficiency of all paths search was carried out by using the software. The results show that search efficiency of the node layer method is increased with the increase of the network size; for the 1010 branches of ventilation network, the node delamination method is improved by 41.59% compared with the deep first search method. The method is suitable for the fast solution of all paths of large scale ventilation network.