In this paper, the issue of modeling the transformations of information links in the architecture of cybersecurity of systems with discretionary access control on graphs using the formal "take-grant" model for the task of synthesizing the cybersecurity architecture is considered. For various initial conditions of the problem, reflecting the requirements for the final state of the structure of information links, modeling algorithms based on the Ford-Fulkerson theorem and methods for finding the smallest edge section of a graph are proposed. A software module has been created that implements the proposed algorithms in Python using the NetworkX library. Examples of the results of the created software module are given.