C# 实现Dijkstra算法

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

Me丶

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

阅读量1.8k

点赞数 2

分类专栏： C# Dijkstra算法文章标签：算法 dijkstra

本文链接：https://blog.csdn.net/qq_24210017/article/details/78456353

版权

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

摘要由CSDN通过智能技术生成

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("===========分析过程=====