Dynamic neighborhood networks

Abstract

In work definitions of dynamic neighborhood networks without feedbacks and with feedbacks are given, rules of their functioning are considered. The difference between input and common nodes of a neighborhood network is shown. A definition of the deadlock state of the network is given. Examples of linear neighborhood networks of the types considered are given. Reduction of the solution of the problem of elimination of the deadlock state in linear networks with feedbacks to the solution of a system of linear equations is shown. An algorithm for simplifying the structure of a linear neighborhood network by eliminating feedbacks is formulated and shown using the example. The above algorithm is implemented in the programming language C ++.