东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2008, Vol. 29 ›› Issue (9): 1253-1256.DOI: -

• 论著 • 上一篇    下一篇

网孔自动搜索算法在水电仿真中的设计与实现

赵海;李占旭;宋纯贺;蒋未未;   

  1. 东北大学信息科学与工程学院;
  • 收稿日期:2013-06-22 修回日期:2013-06-22 出版日期:2008-09-15 发布日期:2013-06-22
  • 通讯作者: Zhao, H.
  • 作者简介:-
  • 基金资助:
    国家火炬计划项目(2002EB010154)

Design and implementation of the algorithm to search mesh in hydropower simulation

Zhao, Hai (1); Li, Zhan-Xu (1); Song, Chun-He (1); Jiang, Wei-Wei (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2008-09-15 Published:2013-06-22
  • Contact: Zhao, H.
  • About author:-
  • Supported by:
    -

RichHTML

1

PDF (PC)

595

摘要： 将电路抽象为图论中的图,在验证了网孔和最小独立闭合环一致性的基础上,把求电路中网孔的问题转化为抽象图中搜索最小独立闭合环的问题;然后以图论中图的广度优先搜索算法为基础,给出了基于广度优先搜索的最小独立闭合环自动搜索算法(BSA)的基本原理和算法描述.实验表明,该算法可以准确高效地搜索出图中所有的最小独立闭合环,算法的运行速度快,占用的空间小,完全可以满足实时性和内存空间的需求.

关键词: 水电仿真, 网孔电流法, 最小独立闭合回路, 广度优先搜索, 最短路径

Abstract: Considering the electric circuit in the abstract and making it an abstract graph in the category of the graph theory, the problem of searching mesh in the circuit is transformed into that to search the minimum independent closed loops in the abstract graph, to which the consistency between mesh and the minimum independent closed loops has been verified. Then, based on the breadth-first search algorithm of graphs, breadth-first based automatic search algorithm namely BSA for the minimum independent closed loops is given with its basic principle and procedure described. Simulation results showed that the algorithm is available to search precisely and efficiently all of the minimum independent closed loops in a graph at high running speed with small memory space occupied. So, it can fully meet the real-time requirements for minimized internal storage.

中图分类号: