最短路径。最短路径问题是图论研究中的一个经典算法问题， 旨在寻找图（由结点和边组成的）中两结点之间的最短路径。-The shortest path. The shortest path problem in graph theory is a classical algorithm issue, aimed at finding the shortest path diagram Two nodes (the nodes and edges) is between.