Algorithms of The Shortest Path and Maximum Flow on Network Models
碩士 === 國立臺灣海洋大學 === 資訊工程學系 === 103 === In this thesis, we investigate the problems of the shortest path and the maximum flow in network models. Regarding finding the shortest path,the classical algorithm of Dijkstra is good and popular. However, it still can be improved in the storage space and...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/73068312746904609815 |