Introduction - If you have any usage issues, please Google them yourself
Find all points on the shortest path problem, let G = (V, E) be a directed graph, where each edge (i, j) by a non-negative length l [i, j], if from the vertex i no edge to the vertex j, then l [i, j] = ∞. To find out from each vertex to all other nodes in the distance, where the vertices from vertex x to y is the distance from x to y represents the shortest path length.
(2) the weight by a graph in which each matrix calculated shortest path between two matrices.
3 from the graph adjacency matrix with the right A = [a (i, j)] n × n starts, recursively updated n times, i.e. by the matrix D (0) = A, according to a formula is constructed matrix D (1) also used the same way by the formula D (1) construct a D (2) ...... finally use the same formula consists of D (n-1) construct a matrix D (n). Matrix D (n) of the i-th row j-th column is the i-th element of the j-th vertex to vertex of the shortest path length, called D (n) of the distance matrix of Fig, while also introducing a successo