利用求最短路w-f算法的思想，首先求得最短距离矩阵，然后求任意给定两个顶点见的最短路所包含的顶点。-Wf seeking the shortest path algorithms use the idea, first seek the shortest distance matrix, and then seek to vertex given any two vertices see shortest contains.