Floyd-Warshall algorithm to calculate the shortest distance and modify the solution in forbidden paths.
碩士 === 國立虎尾科技大學 === 工業工程與管理研究所 === 97 === The essence of this paper is to establish a model for solving the forbidden paths problem. The basic idea of this research is to use the Floyd-Warshall algorithm to calculate the shortest distance between any pair of nodes and modify the solution in case tha...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/kr22b9 |