用邻接多重表实现节点优化编号

AN APPLICATION OF ADJACENCY MULTILIST IN NODE OPTIMIZING CODE

本文提出用无向图来描述电力系统网络结构 ,邻接多重表是无向图的一种比较好的存储结构 ,利用邻接多重表能比较方便的实现对无向图中节点的计算和边的操作 ,如统计节点的度 ,增加一条边 ,删除原有的边。而这些都是节点优化编号中的关键之处。实践证明 ,利用邻接多重表比较容易编程 ,节约内存 。

In fact,the connecting relationship is undirected graph in data relation,and adjacency multi list is a good storing structure of undirected graph.In undirected graph,we can conveniently realize all of the operation,such as statistics the degree of node,add a edge,and delete a edge.The operation mentioning above is the key in the node optimizing code.In practice,it make program more conveniently,more economical.