摘要
本文对几种有向赋权图的最短路长和路径采用Lingo软件对其求解,并分析了用Lingo解法的简便之处和如何处理赋权有向图中的负权问题。对解决此类问题提供了一种新的途径。
In this paper, there are several shortest paths to the weighted graph using Lingo software path length and the solution, and analyzed with a simple solution Lingo place and how to empower a directed graph of the negative rights. Provides a good way to solve this kind of this problem.
出处
《襄樊职业技术学院学报》
2010年第6期25-27,共3页
Journal of Xiangfan Vocational and Technical College
