摘要
论文运用Kruskal算法,求出通信网络的最小化连接成本。出于安全可靠性考虑,要求网络中除某固定的两个结点外,其它任意三个结点被破坏时,仍然能够保持这两个结点之间的通信,论文用LINGO程序遍历出最优解,论文还用Matlab软件,以穷举法为核心,以Dijkstra迪克斯特拉算法和0-1规划作为辅助,编写程序,尽可能地遍历所有的可能解,最终得出的结果与用LINGO软件得出的结果一致,充分证明了答案的准确性。
This paper uses Kruskal algorithm to get the communication network connection cost minimization. For the sake of safety and reliability,requirements in addition to a fixed two nodes in the network,any other three nodes are destroyed,it will still be able to keep this communication between two nodes.In this paper,LINGO program is used to traversal the optimal solution. This article also use the Matlab software,using exhaustive method as the core,to terra dix Dijkstra algorithm and 0-1 programming as auxiliary and write a program,as far as possible to iterate through all possible solutions. Final results are consistent with the results using LINGO software,fully proved the accuracy of the answers.
出处
《计算机与数字工程》
2017年第10期1900-1902,共3页
Computer & Digital Engineering
基金
广东省高职教育一类品牌专业资助项目(编号:2016gzpp007)资助
