Calculation of Flows Intensities Transformations in Acyclic Directed Networks

[摘要] In this paper, a problem of calculation of signals or matters flowsintensities in acyclic network is considered and sequential algorithm ofits solution is suggesting.The problem considered in this paper is discussing last year’ssufficiently intensively in different biological journals [1-3]. InTsitsiashvili [4] a problem of a decomposition of balance equationsfor flows intensities in queuing networks is solving. Such problem isconnecting with calculation of flows intensities of proteins networks.Main idea of this procedure is to find clusters with cyclically equivalentnodes and order them by their maximal distance from input clustersso that direct edges may be only from clusters with smaller to clusterswith larger distances. Therefore, it is possible to divide all nodes intosets A0,A1,…,Ap so that every edge of the graph is only from node i∈ At to node j ∈ Aq, t