摘要
在树形网络拓扑结构中,存在多个网络拓扑节点,不同节点间进行着数据通信。本文描述的算法与传统的二叉树遍历算法不同,采用链表存储结构,支持多分支树形结构,同时也支持节点与节点间的逆向查找,淡化了父子节点概念,通过链表间的数据关系完成数据仿真。
There are multiple nodes in the network topology, they communicate with each other with different data. This paper will describe an algorithm that different with the traditional binary tree traversal algorithm that using the Multi-list to storage the whole topology structure, which supports the reverse lookup in the data simulation at the same time.
出处
《电脑与电信》
2011年第11期49-50,共2页
Computer & Telecommunication
关键词
网络拓扑
多链表
数据仿真
network topology
multi-list
data simulation
