检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]辽宁工程技术大学资源与环境工程学院,辽宁阜新123000 [2]大同煤矿集团公司,山西大同037003
出 处:《辽宁工程技术大学学报(自然科学版)》2003年第6期721-724,共4页Journal of Liaoning Technical University (Natural Science)
摘 要:所谓单向回路就是风路风流方向相同的回路。网络中存在单向回路,也就是说存在着循环风。通路是图论中的一个重要概念,在通风网络中也有着广泛的用途。在介绍无单向回路的通风网络的通路数和通路矩阵计算方法的基础上,提出了含有单向回路的通风网络的通路的矩阵算法的不适用性问题。论述了通过修改搜索策略,利用深度优先搜索法确定通路矩阵的算法,该法既适用于有单向回路时的通风网络,也适用于无单向回路的情况,而且复杂性要比矩阵算法小得多。What is called unidirectional circuit is a circuit whose branches airflow directions are uniform. While we say there are unidirectional circuits in a network, i.e. there are circulating airflows in the network. Path is one of the important concepts of graph theory, and there are also extensive applications in ventilation network theory. Based on the algorithm of the amount and matrix of path of a ventilation network without unidirectional circuits, a further problem is put forward, i.e. the unfitness of the algorithm of the amount and matrix of path to the ventilation network without unidirectional circuits. An algorithm, which is based on the depth-first search method whose search strategy has been amended, to determine path matrix is discussed, and the algorithm suits ventilation network with unidirectional circuits, as well as ventilation network without unidirectional circuits, while the complexity is much less than that of algorithms based on matrix.
关 键 词:通风网络 单向回路 通路算法 深度优先搜索法 搜索策略
分 类 号:TD725[矿业工程—矿井通风与安全]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49