摘要
定义了树节点类来动态地反映节点间的链接关系,采用深度优先算法,快速识别网络拓扑结构的变化。运用树的遍历技术进行实用潮流计算,递归方程的使用使得编程简单,并且不需要形成阻抗阵或导纳阵。
The Type of tree node is defined to show the link relation between nodes,and the depth-first strategy is employed to identify topology structure.Efficient power flow is calculated by means of tree technique and recursion,which do not need resistance or admittance matrix.Numerical results are presented to illustrate the feasibility of the proposed method.
出处
《继电器》
CSCD
2000年第2期17-19,共3页
Relay
