001
002
003
004
005
006
007
008
009
010
011
012
013
014
015
016
017
018
019
020
021
022
023
024
025
026
027
028
029
030
031
032
033
034
035
036
037
038
039
040
041
042
043
044
045
046
047
048
049
050
051
052
053
054
055
056
057
058
059
060
061
062
063
064
065
066
067
068
069
070
071
072
073
074
075
076
077
078
079
080
081
082
083
084
085
086
087
088
089
090
091
092
093
094
095
096
097
098
099
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
package algs41;
import stdlib.*;
import algs13.Stack;
/* ***********************************************************************
 *  Compilation:  javac DepthFirstPaths.java
 *  Execution:    java DepthFirstPaths G s
 *  Dependencies: Graph.java Stack.java StdOut.java
 *  Data files:   http://algs4.cs.princeton.edu/41undirected/tinyCG.txt
 *
 *  Run depth first search on an undirected graph.
 *  Runs in O(E + V) time.
 *
 *  %  java Graph tinyCG.txt
 *  6 8
 *  0: 2 1 5
 *  1: 0 2
 *  2: 0 1 3 4
 *  3: 5 4 2
 *  4: 3 2
 *  5: 3 0
 *
 *  % java DepthFirstPaths tinyCG.txt 0
 *  0 to 0:  0
 *  0 to 1:  0-2-1
 *  0 to 2:  0-2
 *  0 to 3:  0-2-3
 *  0 to 4:  0-2-3-4
 *  0 to 5:  0-2-3-5
 *
 *************************************************************************/

public class DepthFirstPaths {
  private final boolean[] marked; // marked[v] = is there an s-v path?
  private final int[] edgeTo;     // edgeTo[v] = last edge on s-v path
  private final int s;            // source vertex

  public DepthFirstPaths(Graph G, int s) {
    this.s = s;
    edgeTo = new int[G.V()];
    marked = new boolean[G.V()];
    dfs (G, s);
  }

  // depth first search from v
  private void dfs(Graph G, int v) {
    //StdOut.format ("visited %d\n", v);
    marked[v] = true;
    for (int w : G.adj(v)) {
      if (!marked[w]) {
        edgeTo[w] = v;
        dfs(G, w);
      }
    }
  }
  private void dfsLoop(Graph G, int s) {
    Stack<Integer> stack = new Stack<>();
    stack.push(s);

    while (!stack.isEmpty()) {
      int v = stack.pop();
      marked[v] = true; // For DFS, mark as you pop
      for (int w : G.adj(v)) {
        if (!marked[w]) {
          edgeTo[w] = v;
          stack.push(w);
        }
      }
    }
  }
  private void dfsLoopReversed(Graph G, int s) {
    Stack<Integer> stack = new Stack<>();
    stack.push(s);

    while (!stack.isEmpty()) {
      int v = stack.pop();
      marked[v] = true;

      // tmp is used to get the vertices in the same order as used by the recursive version
      // tmp is not necessary, if you don't care about the order
      Stack<Integer> tmp = new Stack<>();
      for (int w : G.adj(v)) {
        if (!marked[w]) {
          edgeTo[w] = v;
          tmp.push(w);
        }
      }
      while (!tmp.isEmpty ())
        stack.push (tmp.pop ());
    }
  }



  // is there a path between s and w?
  public boolean hasPathTo(int w) {
    return marked[w];
  }

  // return a path between s to w; null if no such path
  public Iterable<Integer> pathTo(int w) {
    if (!hasPathTo(w)) return null;
    Stack<Integer> path = new Stack<>();
    for (int x = w; x != s; x = edgeTo[x])
      path.push(x);
    path.push(s);
    return path;
  }

  public static void main(String[] args) {
    args = new String [] { "data/tinyG.txt", "0" };
    //args = new String [] { "data/tinyCG.txt", "0" };

    In in = new In(args[0]);
    Graph G = new Graph(in);
    StdOut.println (G);

    int s = Integer.parseInt(args[1]);
    DepthFirstPaths dfs = new DepthFirstPaths(G, s);

    for (int v = 0; v < G.V(); v++) {
      if (dfs.hasPathTo(v)) {
        StdOut.format("%d to %d:  ", s, v);
        for (int x : dfs.pathTo(v)) {
          if (x == s) StdOut.print(x);
          else        StdOut.print("-" + x);
        }
        StdOut.println();
      }

      else {
        StdOut.format("%d to %d:  not connected\n", s, v);
      }

    }
  }

}