【摘要】 首先提出了最短路网络的概念 ,然后给出了一个时间复杂性为 0 ( n2 )的构造最短路网络的算法 .最后研究了最短路网络在最小成本最短路 ,最短路计数和最短路树中的应用更多还原

【Abstract】 First, this paper puts forward the concept of the shortest path network, then gives a polynomial algorithm to construct the shortest path network, whose complexity is 0(n\+2). Lastly, study some applications in the min\|cost shortest path, ennumberations of the shortest path and the shortest path tree.更多还原