| 利用LinGo求解几种有向图最短路问题 |
| |
| 引用本文： | 刘淋.利用LinGo求解几种有向图最短路问题[J].襄樊职业技术学院学报,2010,9(6):25-27. |
| |
| 作者姓名： | 刘淋 |
| |
| 作者单位： | 福建交通职业技术学院,福州,350007 |
| |
| 摘 要： | 本文对几种有向赋权图的最短路长和路径采用Lingo软件对其求解,并分析了用Lingo解法的简便之处和如何处理赋权有向图中的负权问题。对解决此类问题提供了一种新的途径。
|
| 关 键 词： | Lingo 有向图 最短路 |
Using LinGo Solve Several Shortest Path Problems for Directed Graph |
| |
| LIU Lin.Using LinGo Solve Several Shortest Path Problems for Directed Graph[J].Journal of Xiangfan Vocational and Technical College,2010,9(6):25-27. |
| |
| Authors: | LIU Lin |
| |
| Institution: | LIU Lin (Fujian Communication Technology College Basic Courses Department, Fuzhou Fujian 350007) |
| |
| Abstract: | 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. |
| |
| Keywords: | Lingo directed graph shortest path |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
