Determine If There Is Path From One Vertex To Another - Why Is This Returning False

This method pretty much determines if there is a path from one vertex to another. When I check to see if there is a path from 5 to 2 (which there is) it return false. However, when I create a driver method, it return true (which it should). Why? It should never reach outside of the else because the condition is met, right???

Here is the graph:

0 1 2 3 4 5
------------
0| 0 1 1 0 0 0
1| 0 0 0 0 0 0
2| 0 0 0 1 0 0
3| 1 0 0 0 0 0
4| 0 0 1 0 0 1
5| 0 1 0 1 0 0

Path: 5 points to 1 and 3 (1 does not have a path to anything). 3 points to only 0. 0 points to 1 and 2. Thus there is a path from 5 to 2.

Here is the code without the driver (the one that is returning false, even tho it should be true)

public boolean existsPath(int x, int y){//x = 5, y = 2
stack.push(x);//mark x as visited
if(x == y){//path found
stack.removeAllElements();
return true;

[Code] ....