The problem of finding the complete set of admissible configurations of a distribution network is considered. When solving this problem, the tools of graph theory are used to find the limit graphs. A new method for finding the complete set of limit graphs is proposed, and a number of properties of this method and its soundness are proved. The efficiencies of various methods are compared on a qualitative level, and it is shown that our method is distinguished by a considerably higher computational speed.