摘要
在线性规划中,Warshall和Floyd算法得到了广泛应用,但该算法的效率是制约其应用的关键,特别是对复杂有向图的处理,该算法存在明显的不足。本文在研究Warshall和Floyd算法的基础上,提出一种对该算法的改进与优化方法,旨在提高算法的时间效率,并对改进的算法进行验证,达到了满意的效果。
In linear programming,Warshall and Floyd algorithm is widely used,but the algorithm efficiency is the key to restrict its application.Especially for the handling of a complex directed graph,there exists an obvious shortage of the algorithm.Based on the research on Warshall and Floyd algorithm,this paper proposes an improvement of the algorithm,aiming at improving the efficiency of the algorithm＇s time,and the improved algorithm is verified to achieve a satisfactory result.
出处
《计算机与现代化》
2010年第4期43-45,56,共4页
Computer and Modernization
关键词
算法
研究
改进
algorithm
research
improvement
