老中搞出最短路径新算法
版主: hci
#1 老中搞出最短路径新算法
+1.00 积分 [版主 hci 发放的奖励]
I walked in the valley of shadow of death,
Yet I had no fear;
For I was the meanest
over there.
Yet I had no fear;
For I was the meanest

标签/Tags:
#3 Re: 老中搞出最短路径新算法
I walked in the valley of shadow of death,
Yet I had no fear;
For I was the meanest
over there.
Yet I had no fear;
For I was the meanest

#10 Re: 老中搞出最短路径新算法
嗯,理论意义不小,但实际意义不是很大。Dijkstra相当于是从起点逐渐外扩一个“圆”直到接触到终点,从起点到“圆”内所有点的最短路径都求解了。应用中可以有非常多的优化,实际效果应该强于这个新算法。
x1
