Compile a routing table using a static routing algorithm

Abstract

The example we offer is interesting in that in the process of performing calculations, the existing routes are repeatedly replaced by shorter ones and each subsequent computation process must be considered to get the correct final result. However, in the real situation it is noteworthy that only the short distance does not determine the factor of fast delivery of information. The example under consideration is a rather interesting visible option for solving the given task (by determining the optimal shortest path) and can be successfully used in the learning process in this direction