Based on depth first search, the article USES route deletion and nodedeletion methods to produce multi-solutions, and then determine the optimum solution with least costing.
以深度优先搜索作为基本算法，用路径删除和结点删除方法产生多重解，用最小成本法求出最优解。
2
Once the deletion has completed successfully, the node is removed from the tree and a status message is displayed in the output view in the IDE.
当删除成功完成后，节点将从树中移除并在IDE的输出视图中显示一条状态消息。
3
Listing 7 shows the code snippet that's handling the deletion of a node from the tree.