Description: By weight of a graph in which each matrix calculated shortest path between two matrices. From the graph adjacency matrix with the right A = [a (i, j)] nn starting 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 successor node matrix to record the path between two points the shortest path.
To Search:
File list (Check if you may need any files):
sds.txt
Download