ABSTRACT
The matrix partial multiplication method computes all connective sets in parallel, which is to search all connected graph simultaneously. In the procedure when a row of the connectivity matrix is uncertain whether it belongs to an existing connective set or is the first row of a new connective set, this row must be computed, such many rows of connectivity matrix in a connective set must be computed. If we compute new connective set after all the nodes in the preceding connective set are found rather than all connective sets are computing in parallel, the computation of other rows except the first row in each connective set can be avoidable. Accordingly a new network topology
1 INTRODUCTION
To provide the bus/branch model for many power system studies such as state estimation, power flow and contingency analysis, the power system network topology algorithm plays a very important role in the monitoring and control of power systems. The traditional network topology algorithms are search method and matrix method both of which are popular methods to find connective graph in graph theory. Besides these two basic methods, Yao et al. (2009) presented a new network topology method by solving logic equations.
