The shortest path problem
no vote
Defines a priority queue to save source points to a known path length of each node, and the node number. Remove the node from the queue, and if the point is to find the shortest path, then no processing is done, otherwise check the each node of the shortest path is not found, with the shorter the current node of the path, subsequent path is modified and incorporated into the team.