C# 实现Dijkstra算法

最新推荐文章于 2023-11-24 10:56:34 发布

原创

最新推荐文章于 2023-11-24 10:56:34 发布 · 1.8k 阅读

17 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #dijkstra

本文详细介绍了如何用C#编程语言实现Dijkstra算法，通过实例展示了算法的运行结果，帮助读者理解Dijkstra算法在寻找图中两点间最短路径的应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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("===========分析过程===========" + "\n \n");
            Console.Write("第1步："+"\n");
            Console.Write("初始TT数组为:");
            for (int c = 0;c<6;c++)
            Console.Write(TT[c]+" ");
            Cons