| 用摹矩阵寻求网络的最短路 |
| |
| 引用本文： | 唐志丹.用摹矩阵寻求网络的最短路[J].鞍山科技大学学报,1991(4). |
| |
| 作者姓名： | 唐志丹 |
| |
| 作者单位： | 鞍山钢铁学院管理系 |
| |
| 摘 要： | 应用了半城、摹矩阵和优选半域等概念,把摹矩阵的计算运用到图论中的寻求负权网络中的最短路以及寻求网络中各点间的最短路问题上。实例的计算结果表明,这是一种计算简便,行之有效的方法.
|
| 关 键 词： | 半域 优选半域 摹矩阵 网络中的最短路 |
Applying the Modulo-Matrix to Find the Shortest Path in a Network |
| |
| Tang Zhidan Dept. of Management Engineering.Applying the Modulo-Matrix to Find the Shortest Path in a Network[J].Journal of Anshan University of Science and Technology,1991(4). |
| |
| Authors: | Tang Zhidan Dept of Management Engineering |
| |
| Institution: | Tang Zhidan Dept. of Management Engineering |
| |
| Abstract: | It is applied some concepts such as the semi-field modulo-matrix and opti-semi-field to the graph
theory. It uses the modulo-matrix as a tool to solve the problem of finding the shortest path in a
negative weight network, and the problem of finding the shortest path from all vertices to all others
in a network. The results of computation for actual examples show that the method presented here
is actually effective and more convenient and simpler than common methods. |
| |
| Keywords: | semi-field opti semi-field modulo-matrix shortest path in a network |
| 本文献已被 CNKI 等数据库收录！ |
