Fatal编程技术网
  • algorithm/
  • Algorithm 动态规划与Dijkstra

Algorithm 动态规划与Dijkstra

algorithm language-agnostic

Algorithm 动态规划与Dijkstra,algorithm,language-agnostic,dynamic-programming,shortest-path,Algorithm,Language Agnostic,Dynamic Programming,Shortest Path,我正在阅读下面的问题陈述，它是用动态规划来解决的： 给定一个有N（1Yes）的无向图G，它似乎在引导你转向Dijkstra的算法。是的，它似乎在引导你转向Dijkstra的算法。 S = starting point N = ending point initialize all distances from S to +infinity unexplored_vertices[] = [all vertex adjacent to S] for each v in unexplored_ve

我正在阅读下面的问题陈述，它是用动态规划来解决的：

给定一个有N
（1Yes）的无向图G，它似乎在引导你转向Dijkstra的算法。是的，它似乎在引导你转向Dijkstra的算法。

S = starting point
N = ending point
initialize all distances from S to +infinity
unexplored_vertices[] = [all vertex adjacent to S]

for each v in unexplored_vertices[]
  calculate new_distance from S to v
  if new_distance is better than the former then
    store new_distance
  closest_to_v = find(unexplored_vertices[], closest_to_S)
  unexplored_vertices[].add_front(closest_to_v)

return distance from S for N