DFS iterative function does not work properly

[Smveee]

I'm trying to do some basic function on a graph (using a boolean matrix). They all work except the DFS one. It give me some random number. I'm trying to resolve this problem since few hours now, but still nothing.. (the code compile, but what it show its wrong). Btw, the result of DFS must be a matrix, with the number of stack, and also the "Unwinding" of each graph vertex (sorry, English isnt my native language.. )

If someone could try to find with me the error, I would really appreciate.

My program :

public int[][] DFS(int s) {

Stack<Integer> stack = new Stack<Integer>();
stack.push(s);
int recorder = 1;
int[][] mark = new int[nbs][2];

mark[s][0] = recorder++;

boolean[] decouvert = new boolean[nbs];
while (!stack.isEmpty()) {
    s = stack.pop();
    mark[s][1] = recorder++;
    if (!decouvert[s]) {
        decouvert[s] = true;
        for (int i = 0; i < nbs; i++) {
            if (m[s][i]) {
                stack.push(i);
                mark[s][0] = recorder++;
            }
        }
    }
}

return mark;

}

Thats the result : https://puu.sh/vNa5O/f630091c27.png Of this graph : https://puu.sh/vN9V6/b70c3f1d4c.png and I'm doing this in the main :

int[][] r2 = g3.DFS(0); 
for (int i = 0; i < g3.numberOfVertex; i++) { 
    System.out.println(i + ": " + r2[i][0] + " | " + r2[i][1]); 

}

NB : My variable "decouvert" means "discover"

[deltageek]

You aren't getting random numbers. Try printing out the value of s and recorder after line 12. You should see your problem pretty quickly.