启发式的网络拓扑图生成算法的构造及实现

The Structure and Implementation Heuristic Algorithm of Topological Graph Generation of Network

针对大型、复杂网络系统的拓扑图显示 ,提出一种改进算法 ,即启发式一般网络拓扑图生成算法 .它将分而治之的思想应用到常规算法中 ,将复杂网络逻辑分割成若干小型域 ,先计算每个域所占用空间与外部域的连接特性 ,再考虑整个网络的连接 .该算法的运算复杂度低 ,对于大型。

An improved algorithm named heuristic algorithm is given to show topological graph of big and complicated systems. Applying the idea of division rule into regular algorithms the complicated network can be divided into several small areas logically. In this algorithm, the space occupied by each area and the connected characteristic of outside area are calculated first, then the connection of the whole net is considered. Since the improved algorithm contains lesser operations, it is much practical for quick displaying the topological graph with big and complicated network structure.