Whereas the cut vertex or the small vertex cutset extraordinarily threaten the connectivity of overlay networks,for the removal of them will separate the network into many components.

In order to relieve this situation,this paper makes use of the independence condition to decompose the whole Bayesian network according to the characteristics of safety analysis,compresses the items number in reasoning process,proposes the algorithms for top event probability and cut sets,simultaneously analyses the computational complexity.

The paper proposed a method called CSA-CJ which is adapt to find cut sets of huge highway transportation network.

Facing the question of max-flow in network,based on cut set define and max-flow min-cut theorem,with adjacency matrix to deposit network data,using the data structure of stack to organise network data,traversing all cut sets,the minimum capacity in all cut sets is max-flow in network.

Research on generation algorithm of assembly sequence based on cut-set under integration circumstance;

Based on the theoretical analysis of the establishment of cut-set voltage equation,a more straightforward and simplified way has been proposed.

The systematic method of the large scale network is presented by using network Graph Theory and matrix algebra and through the analysis of the independent equation of the large scale network cut-set voltage.

On the basis of network transient energy function,the relationship between the distribution of transient energy in network and system stability,and analysis of transient energy including vulnerable cutset distribution over fault circuitry after fault clearing,the adaptive setting method on reclosing time of permanent fault was proposed in this paper.

The main merit of the algorithm is the combination of the assembly unit cutset and hierarchical unit division.

An algorithm is presented, and the assembly AND/OR graph is generated by cutset calculation of the relation graph.