C# 实现Dijkstra算法

public void Dijkstra()
        {
            int [,] A = new int[6,6]
                {
                     {0,20,30,28,2048,2048 },
                     {2048,0,20,2048,30,2048},
                     {2048,2048,0,10,25,2048},
                     {2048,2048,2048,0,2048,32},
                     {2048,2048,2048,2048,0,15},
                     {2048,2048,2048,2048,2048,0}
                };
            int i = 0;
            int []TT = new int[6];
            int min = 0;
            string[] path = new string[6] {"","","","","",""};
            string thisPath = "";
            string allPath = "1";
            int z = 0;
            Console.Write("\n");
            Console.Write("          Dijkstra算法" + "\n \n");
            Console.Write("===========分析过程=====