An Improved Breadth-First Search Method Based on Information Interaction Applied for Power Network Topology Analysis

Algorithm 1

Pseudocode of traditional topology analysis method. Algorithm name: Algorithm_A.

(1)	m = V.size()
(2)	for (i = 0; i < m; i ++) do
(3)	if V[i][0] = = i + 1 then
(4)	q = V[i];
(5)	jump = 1;
(6)	while jump < len do
(7)	V[q[jump] − 1][0] = q[0];
(8)	if V[q[jump] − 1].size() > 2 then
(9)	for (j = 1; j < V[q[jump] − 1].size(); j ++) do
(10)	if V[q[jump] − 1][j] not in q then
(11)	q.push_back (V[q[jump] − 1][j]);
(12)	end if;
(13)	end for;
(14)	end if;
(15)	jump++;
(16)	end while;
(17)	Q.push_back(q);
(18)	else
(19)	continue;
(20)	end if;
(21)	end for;