【摘要】 在采用关系型数据结构描述电力网网络图之后 ,分析了网络图的连接关系与相应的关系型数据特征之间的规律 ,设计出简捷、合理 ,运行效率高的算法 .在由关系型数据库生成树的过程中 ,通过冗余信息的筛选及删除、生成树记录的转移 ,网络图的连通性随即显现出来 .另外 ,采用关系型数据结构描述网络图及其生成树 ,数据结构简洁 ,包含信息量充分 ,特别适合于网络图中孤立网的查找和修复 ,再借助强大的数据库前端开发平台 ,使得应用软件的开发及其运行简单高效更多还原

【Abstract】 With the connectivity of electrical power networks is dealsed. We described the graph using relation data structures and analyzed the regularity between connection relationships in a graph and their characteristic data. The algorithm designed in the paper is simple and direct, reasonable and efficient. In the course of producing the product tree from a relation database the redundant information was deleted, the records of producing the tree were removed and then the connectivity of the networks was revealed. At the same time the relation data structures that describe the networks and the product tree are simple and direct, and include a large amount of information. The method presented in this paper is especially suitable for finding and restoring isolated sub networks.更多还原