/*** Created by huazhou on 2015/12/6.*/
public class TestSearch {public static void main(String[] args){Graph G = new Graph(new In(args[0]));int s = Integer.parseInt(args[1]);
//        DepthFirstSearch search = new DepthFirstSearch(G, s);
//        Paths search = new Paths(G, s);
//        DepthFirstSearch search = new DepthFirstSearch(G,s);BreadthFirstPaths search = new BreadthFirstPaths(G,s);findAllPaths(search, G, s);}private static void findAllPaths(BreadthFirstPaths search, Graph G, int s){for(int v = 0; v < G.V(); v++){StdOut.print(s + " to " + v + ": ");if(search.hasPathTo(v)){for (int x : search.pathTo(v)){if(x == s){StdOut.print(x);}else{StdOut.print("-" + x);}}}StdOut.println();}}
}

/*** 算法4.2 使用广度优先搜索查找图中的路径* Created by huazhou on 2015/12/9.*/
public class BreadthFirstPaths {private boolean[] marked;   //到达该顶点的最短路径已知吗？private int[] edgeTo;   //到达该顶点的已知路径上的最后一个顶点private int s;  //起点public BreadthFirstPaths(Graph G, int s){marked = new boolean[G.V()];edgeTo = new int[G.V()];this.s = s;bfs(G, s);}private void bfs(Graph G, int s){Queue<Integer> queue = new Queue<Integer>();marked[s] = true;   //标记起点queue.enqueue(s);   //将它加入队列while(!queue.isEmpty()){int v = queue.dequeue();    //从队列中删去下一顶点for (int w : G.adj(v)){//对于每个未被标记的相邻顶点if(!marked[w]){edgeTo[w] = v;  //保持最短路径的最后一条边marked[w] = true;   //标记它，因为最短路径已知queue.enqueue(w);   //并将它添加到队列中}}}}public boolean hasPathTo(int v){return marked[v];}public Iterable<Integer> pathTo(int v){if(!hasPathTo(v)){return null;}Stack<Integer> path = new Stack<Integer>();for (int x = v; x != s; x = edgeTo[x]){path.push(x);}path.push(s);return path;}
}