Introduction - If you have any usage issues, please Google them yourself
1 to the vertex set V into S (the beginning contains only the source, S contains the points are already calculated the shortest path points) and set VS (VS contains the points that determined the shortest path) 2. From the VS select a vertex w: S set to meet through any vertex v shortest path to w that satisfy (the path of the source to the v+ v to w in the path of) the smallest one that w. v belong to S, w belongs to SV. The w added S, and removed from the VS w. 3. So repeatedly, until the empty set up VS