增删边对最短路径影响的研究

On the Influence of the Shortest Path When Adding or Deleting Some Edges to Form a Digraph

在有向图中加入或删除一些边时，可能有多种可选的方案，通过对各种方案影响最短路径的大小进行研究；给出联通权重值的定义和对最短路径贡献大小的规定。

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.