Introduction - If you have any usage issues, please Google them yourself
Data structure to achieve the shortest path algorithm can be realized digraph, undirected graph, to the network, without the four shortest path to the network to solve the final print path, and path length