（1）对每一个顶点 分配三个信息， 、 、 ，其中 是一个布尔型变量，

（1）对每一个顶点 分配三个信息， 、 、 ，其中 是一个布尔型变量，表明顶点 的最短路径是否已经求出； 是从 到 的当前已知的最短路径长度的上界； 是 的后向顶点指针，并分别初始化为：

結果 (英文) 1:

(1) for each vertex three information,, which is a Boolean variable, indicates that the shortest path to vertex are obtained; from the upper bound of the length of the shortest path to the currently known Yes back pointers to vertices, and initialized:

結果 (英文) 2:

(1) For each vertex three information distribution,,,, which is a Boolean variable indicating whether the vertices of the shortest path has obtained; after yes; are from the upper bound to the current length of the shortest path known a pointer to the vertex, respectively, is initialized as follows:

結果 (英文) 3:

(1) for each vertex is assigned three information,,,, which is a boolean, indicating whether the shortest path vertex has been calculated; is the upper bound of the shortest path length from the currently known to; is backward vertex pointers, and respectively initialize: