大型网络系统最小路集的优化计算方法

Optimized method for calculating minimal path sets of large-scale network system

在大型网络系统最小路集计算的节点遍历方法基础上 ,提出了大型网络系统最小路集计算的优化节点遍历方法 .由于采用了高阶数组降维技术和动态数组技术 ,节省内存占用率 ,提高了运算速度 .计算过程中 ,动态数组完成运算功能时 ,及时释放占有的内存空间 ,使得运算速度明显提高 ,为后续的网络系统可靠性和维修性分析 ,节省了大量内存 .并且采用标准、规范的 Fortran 90和

Based on the nodes-searching method of calculating minimal path sets of large-scale network system, a new optimized method is presented for calculating minimal path sets. High-order arrays are represented to low-order arrays and dynamic arrays are used in the method. The internal storage space occupied by every dynamic array is immediately freed after its function realized. Saving internal storage space is very important in reliability and maintenance analysis of the large-scale network system. The proposed method is programmed using Fortran 90 and C++ languages.