Introduction - If you have any usage issues, please Google them yourself
The first city to find the shortest path to other cities. With a matrix (for the number of vertices) records of the right side of the adjacency matrix, row vector, were used to store label information and label the vertex order, label the vertex indexes, the shortest pathway value