摘要
不同于以往基于网络节点的算法,在简单数据结构的基础上,依次提出了两种算法效率与网络节点半相关(节点标记算法)及与网络节点完全无关(往返替换算法)的快速算法。理论分析和实例表明了这两种算法具有编程简单,不含乘法运算,需求存储空间小,对网络结构改变适应性良好的特点,大大缩短了电网连通性判别所需时间。
Unlike previous algorithms based on network nodes, this paper proposes a node-branch-related algorithm （NMA） and a branch-related algorithm （TRA） based on a simple data structure. Theoretical analysis and examples show that the two new algorithms are of non-multiplication, with much less storage space, easy to program, shortening the time to discriminate network connectivity, and adaptabile when network structure changes.
出处
《电力系统保护与控制》
EI
CSCD
北大核心
2008年第17期16-18,50,共4页
Power System Protection and Control
关键词
连通性
电力网络
快速算法
图论
邻接矩阵法
connectivity
electricity network
high-speed algorithm
graph theory
adjacency matrix
