论文部分内容阅读
本文给出了一种求解运输问题的算法——最小生成树算法，采用树状数据结构存 储基本可行解．采甲二叉树遍历算法求位势．沿逆向指针找出闭回路，占用存储空间 少、运算速度快。文中对该算法与已有的一些求解运输问题的位势法作了分析比较。 文中还指出：若对此算法所采用的数据结构和实现的运算适当地加以修改便可应用于 求解一般的网络规划问题．
This paper presents an algorithm to solve the transport problem - the minimum spanning tree algorithm, the use of tree data structure to store the basic feasible solution. Mining a binary tree traversal algorithm to find potential. Find the closed loop along the reverse pointer, occupying less storage space, computing speed. In this paper, the algorithm is compared with some existing potential solutions to the transportation problem. The article also pointed out: If the algorithm used in the data structure and implementation of the appropriate changes to be applied to solve the general network planning problems.