摘要
本文运用布尔代数、线性代数以及网络的拓扑关系,比较了计算机检测网络连通性的直接搜索法、浅析法、行扫描法和行累加算法,从减少计算机运算次数出发,对行累加算法作了初步改进,编制了改进的程序框图和程序,并上机进行了调试和运行。
The article uses topological relation of Bcolearn algebra, Linear algebra and networ compares the methed of direct searching easy analysis Line scanning and line progessive algorithmic of testing networ connection of the computer. In order to reduce the computer operation frequency. The article makes initial improvment on the line prcrgressive algorithmc, edits improved prograxn block diagram and program, debug and run on the comuter.
出处
《电力学报》
1999年第3期183-188,共6页
Journal of Electric Power
关键词
电网
连通性
检测方法
网络
节点
支路
布尔型N阶矩阵
数组
Nework
node branch way
Boolean matrix of order N
connectedenss of order N
system of numbers