public int DFS(In in, int s) throws IOException {
        showString(" * Depth First Paths: (DFS Implemention)\n");

        DepthFirstPaths dfs = new DepthFirstPaths(G, s);

        for (int v = 0; v < G.V(); v++) {
            if (dfs.hasPathTo(v)) {
                showString(s + " to " + v + ":   ");
                for (int x : dfs.pathTo(v)) {
                    if (x == s) {
                        showString(" " + x);
                    } else {
                        showString("-" + x);
                    }
                }
                showString("\n");
            }

            else {
                showString(s + " to " + v + ":  not connected\n");
            }

        }
        showString("\n");
        return 0;
    }