| 增删边对最短路径影响的研究 |
| |
| 引用本文： | 班世炳.增删边对最短路径影响的研究[J].广西民族大学学报,1998(2). |
| |
| 作者姓名： | 班世炳 |
| |
| 作者单位： | 广西民族学院物理与电子工程系 |
| |
| 摘 要： | 在有向图中加入或删除一些边时，可能有多种可选的方案，通过对各种方案影响最短路径的大小进行研究；给出联通权重值的定义和对最短路径贡献大小的规定，并给出在多种可能方案中选择最佳方案的具体算法
|
| 关 键 词： | 带权 有向图 最短路径 算法 联通权重 |
On the Influence of the Shortest Path When Adding or Deleting Some Edges to Form a Digraph |
| |
| Ban Shibing.On the Influence of the Shortest Path When Adding or Deleting Some Edges to Form a Digraph[J].Journal of Guangxi University For Nationalities(Natural Science Edition),1998(2). |
| |
| Authors: | Ban Shibing |
| |
| Abstract: | If adding or deleting some edges to form a digraph, there maybe are many ways .In this paper the writer discusses every Ways effecting on the shortest path . This paper define the connect weight and stipulate what is the best way and then describe a complete algorithm. |
| |
| Keywords: | Weighted Digraph The shortest path Algorithm Connect weight |
| 本文献已被 CNKI 等数据库收录！ |
