java邻接矩阵中BFS的顺序是什么？

Question

给定一个邻接矩阵

int[][] grid = new int[5][5];

递归地，DFS顺序将是

//y = Row
//x = Column

//Down
grid[y + 1][x];

//Up
grid[y - 1][x];

//Right
grid[y][x + 1];

//Left
grid[y][x - 1];

以迭代方式，DFS顺序将是

//Left
stack.push(y);
stack.push(x - 1);

//Right
stack.push(y);
stack.push(x + 1);

//Up
stack.push(y - 1);
stack.push(x);

//Down
stack.push(y + 1);
stack.push(x);