以下是我们教授给我们的算法摘要。
步骤 3 中提到的图中节点的父节点是什么？我有点困惑，因为我认为节点只有邻居而没有父节点？
我的第二个问题是关于第 3 步，“拾取堆栈中的第索引条记录”。由于堆栈只允许您查看顶部，所以我不确定拾取第索引记录意味着什么？
Dijkstra 的最短路径：
Step 0: if s == d, stop.
Step 1: current node c= s, c.length = 0, stack.push (c, its length, and parent).
If u is the source s then no need for parent.
Step 2: min = 0, hop = infinite, index = 1
Step 3: pick up the index’th record in stack, say node u, its length u.length,
and its parent w.
Step 4: find a neighbor of u in the table of neighbors, say v, such that v is
not found in any item in stack and <u,v> +u.length< hop.
Step 5: if such a neighbor is found, hop=min=u.length + <u,v> and record_node = v
Step 6: go to step 4 until all the neighbors of u have been tried (all can be
found in stack).
Step 7: index ++, go to step 3 until all the nodes have been tried (found in
stack).
Step 8: c = record_node, c.length = min, stack_push(c, c.length, u). If c == d
stop the entire process and goes to step 9 for data collection,
otherwise go to step 2.
Step 9: (t, d.length, and t.parent) = (d, d.length, and d.parent) in stack,
keep searching on (t.parent, t.parent.length, t.parent.parent),
until t.parent = s.
