一种基于稀疏矩阵的求路径集的新算法  

A New Algorithm to Find Paths Based on Sparse Matrix

作　　者：黄镇建[1] 蔡群英[2] 

机构地区：[1]韩山师范学院物理与电子工程系,潮州521000 [2]韩山师范学院数学与信息技术系,潮州521000

出　　处：《计算机与数字工程》2009年第11期28-29,102,共3页Computer & Digital Engineering

摘　　要：最短路径dijkstra算法只能适用于一个QoS参数,而对于多个QoS参数的综合考虑,只能采用遗传算法来优化,提出求编码空间路径集的一种新算法,采用稀疏矩阵存储图的邻接关系,随机选取路径。此算法具有存储空间少、时间复杂度小、不需对网络拓扑做任何修改的优点。The shortest path＇s algorithm dijkstra is only used for one QoS parameter, but for multiple QoS parameters to be considered, genetic algorithmic can be adopted. The paper proposed a new algorithm to find paths for encoding space, the new algorithm is used sparse matrix to store the topology information of the network, and the path is selected randomly. The algorithm has some advantages, such as less storage space, less complexity of the calculation time, and don＇t need to do any changes to Network topology.

关 键 词：路径集 稀疏矩阵 最短路径 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]