DFS方法不能正常工作

Question

我期望DFS方法打印路徑爲1-> 2-> 4-> 5，但它顯示1-> 2-> 3-> 4-> 5請問您可以提示方法可以使用最少的代碼量來修正？

/** 
* Created by mona on 5/28/16. 
*/ 

import java.util.Stack; 

public class DepthFirstSearch { 
    public static void DFS(GraphNode root, int num) { 
     if (root.val == num) { 
      System.out.println("root has the value "+num); 
     } 
     System.out.println(" current value is "+root.val); 
     Stack<GraphNode> stack = new Stack<>(); 
     stack.push(root); 
     while (!stack.isEmpty()) { 
      for (GraphNode g : stack.pop().neighbors) { 
       if (!g.visited) { 
        System.out.println(" current value is "+g.val); 
        if (g.val == num) { 
         System.out.println("Found"); 
        } 
        g.visited = true; 
        stack.push(g); 
       } 
      } 
     } 
    } 

    public static void main(String[] args) { 
     GraphNode n1 = new GraphNode(1); 
     GraphNode n2 = new GraphNode(2); 
     GraphNode n3 = new GraphNode(3); 
     GraphNode n4 = new GraphNode(4); 
     GraphNode n5 = new GraphNode(5); 

     n1.neighbors = new GraphNode[] {n2}; 
     n2.neighbors = new GraphNode[] {n4,n3}; 
     n3.neighbors = new GraphNode[] {n4}; 
     n4.neighbors = new GraphNode[] {n5}; 
     n5.neighbors = new GraphNode[] {}; 

     DFS(n1, 5); 
    } 
} 

下面是GraphNode類的代碼：

/** 
* Created by mona on 5/27/16. 
*/ 
public class GraphNode { 
    int val; 
    GraphNode next; 
    GraphNode[] neighbors; 
    boolean visited; 

    GraphNode(int val) { 
     this.val = val; 
     this.visited = false; 
    } 

    GraphNode(int val, GraphNode[] neighbors) { 
     this.val = val; 
     this.neighbors = neighbors; 
     this.visited = false; 
    } 

    public String toString() { 
     return "value is: "+this.val; 
    } 

} 

Answer 1

要到這個節點的路徑，這是不夠的，只是添加所有您遇到的節點，因爲你可能會遇到一個「死衚衕「在圖中或添加實際不在路徑上的節點。爲了防止這一點，你需要保持包含一個節點作爲鄰居，當你插入他們到堆棧中的節點的軌跡：

Map<GraphNode, GraphNode> parents = new HashMap<>(); 
outer: while (!stack.isEmpty()) { 
    GraphNode currentElement = stack.pop(); 
    for (GraphNode g : currentElement.neighbors) { 
     if (!g.visited) { 
      parents.put(g, currentElement); 
      System.out.println(" current value is "+g.val); 
      if (g.val == num) { 
       System.out.println("Found"); 
       List<GraphNode> path = reconstructPath(parents, g); 

       // use path, e.g. 
       System.out.println(path.stream().map(n -> Integer.toString(n.val)).collect(Collectors.joining("->"))); 

       break outer; 
      } 
      g.visited = true; 
      stack.push(g); 
     } 
    } 
} 

static List<GraphNode> reconstructPath(Map<GraphNode, GraphNode> parents, GraphNode end) { 
    List<GraphNode> list = new ArrayList<>(); 
    while (end != null) { 
      list.add(end); 
      end = parents.get(end); 
    } 
    Collections.reverse(list); 
    return list; 
}