通过修改搜索策略，用深度优先搜索法确定通 路的矩阵算法，模拟计算有单向回路的通风网络。
The simulative calculation method and the results of multi-fan-station ventilation network with unidirectional circuits are described.
采用深度优先搜索法，文章首次提出了在搜索过程中采用标记距离的算法，有效地求解复杂网络和图的最短距离问题。
The shortest path problem in complex networks and graphs can be easily solved by labeling the distance between current point and start point during depth- first- search.
采用深度优先搜索法，文章首次提出了在搜索过程中采用标记距离的算法，有效地求解复杂网络和图的最短距离问题。
The shortest path problem in complex networks and graphs can be easily solved by labeling the distance between current point and start point during depth- first- search.
应用推荐