This paper analyzes efficiency of two techniques for verification of success states in the network. The first method verifies existence some links in the network using o successive drop out method of nodes until it is generated o link between these nodes. The second method is based on the successive connection of nodes to the trees which have as root source nodes or system nodes. There are compared these methods and are applied for a test network.
