Computing the matrices of lengths of minimal paths in optimizing the topology of communication networks

For methods whereby communication channels are introduced and/or eliminated an economical algorithm is proposed for recomputing the matrix of lengths of minimal paths between points in the network. The labor consumption of the algorithm almost alwaysamounts to $O(n)$ computing operations where $n$ is the number of points.