A hybrid algorithm combined with dynamic programming and the lower bound ( or upper bound ) algorithm is proposed. It is on the basis of analysing the depth first search ( DFS ) and the breadth first search ( BFS ) methods. 本文分析了深度优先搜索方法(DFS)和广度优先搜索(BFS)方法的特点,提出了一种混合使用动态规划方法和下界(上界)算法的精确求解方法求解组合优化问题。
SEARCH DEPTH FIRST must be specified if all child data ( over all levels ) must be returned first before returning the data of the next parent. 如果必须在返回下一个父数据的数据之前返回所有的子数据(所有级别上),则必须指定SEARCHDEPTHFIRST。
This paper, by using First Depth Search, presents a new topological formula to compute ST reliability of acyclic direct networks ( at least there is an operative path from source to sink ). 本文利用第一深度搜索法(First-Depth-Search)提出一个计算无圈有向网络的ST可靠性(至少存在一条从源点到汇点正常运行道路的概率)的新拓扑公式。