A method to mark transitive predecessors and transitive successors by using depthfirstsearch is provided with a description of the algorithm based on stack.
Based on depthfirstsearch, the article USES route deletion and node deletion methods to produce multi-solutions, and then determine the optimum solution with least costing.
以深度优先搜索作为基本算法，用路径删除和结点删除方法产生多重解，用最小成本法求出最优解。
3
As you can see if you compare Listings 2 and 3, the processor takes care of much of the basic coding (such as looping and passing parameters) to implement a depth-firstsearch.