所以,我已经看到了类似的问题,这但不是之间有很大正是我要找的。我需要修改Dijkstra算法以返回顶点S(源)和顶点X(目标)之间的最短路径。我想我已经想出了该做什么,但我想要一些帮助。这是我修改过的伪代码。修改Dijkstra算法得到最短路径两个节点
1 function Dijkstra(Graph, source, destination):
2 for each vertex v in Graph: // Initializations
3 dist[v] := infinity ; // Unknown distance function from
4 // source to v
5 previous[v] := undefined ; // Previous node in optimal path
6 end for // from source
7
8 dist[source] := 0 ; // Distance from source to source
9 Q := the set of all nodes in Graph ; // All nodes in the graph are
10 // unoptimized - thus are in Q
11 while Q is not empty: // The main loop
12 u := vertex in Q with smallest distance in dist[] ; // Start node in first case
13 remove u from Q ;
14 if dist[u] = infinity:
15 break ; // all remaining vertices are
16 end if // inaccessible from source
17
18 for each neighbor v of u: // where v has not yet been
19 // removed from Q.
20 alt := dist[u] + dist_between(u, v) ;
21 if alt < dist[v]: // Relax (u,v,a)
22 dist[v] := alt ;
23 previous[v] := u ;
24 decrease-key v in Q; // Reorder v in the Queue
25 end if
26 end for
27 end while
28 return dist[destination];
的代码是从维基百科和修改:http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
这是否看起来是正确的?
为什么你需要修改它?这正是它所做的。当您将所有边权重设置为1. –
这是我已经修改的代码。所以如果它的效果很好。 – csnate
此外,由于Dijkstra中的顶点选择是贪婪的,只要您获得“u = destination”,就可以打破循环。 –