BFS并通过邻接矩阵找到最短路径

Question

我正在尝试实现BFS并通过邻接矩阵找到最短的路径。但是BF几乎总是返回错误的结果。我在做什么错？

private static bool BFS(int[,] adj, int src, int dest, int v, int[] pred, int[] dist)
        {
            Queue<int> queue = new Queue<int>();
            bool[] visited = new bool[v];
            for (int i = 0; i < v; i++)
            {
                visited[i] = false;
                dist[i] = int.MaxValue;
                pred[i] = -1;
            }
            visited[src] = true;
            dist[src] = 0;
            queue.Enqueue(src);

            while (queue.Count != 0)
            {
             
               int u= queue.Dequeue();

                for (int i = 0; i < adj.GetLength(0); i++)
                {
                    if (visited[i] == false && adj[u,i]!=0)
                    {
                        visited[i] = true;
                        dist[i] = dist[u] + 1;
                        pred[i] = u;
                        queue.Enqueue(i);

                        // stopping condition (when we
                        // find our destination)
                        if (i == dest)
                            return true;
                    }
                    visited[u] = true;
                }
            }
            return false;
        }
    }

Answer 1

for (int i = 0; i < adj.GetLength(0); i++)

这对我来说很奇怪。应该不是：

for (int i = 0; i < adj.GetLength( u ); i++)