树的邻接矩阵  

Adjacency Matrices of Trees

作　　者：张英丽[1] 顾玉宛[1] 解世艳[1] 曹黎[1] 

机构地区：[1]江苏工业学院信息科学与工程学院,江苏常州213164

出　　处：《江苏工业学院学报》2009年第2期47-49,共3页Journal of Jiangsu Polytechnic University

摘　　要：研究了树的邻接矩阵,总结邻接矩阵的性质:树的邻接矩阵可以存储表示树,由树的邻接矩阵容易判定各个结点的度和该结点是否为叶子,可以并行计算各个结点的子孙结点的数目,特别讨论了二叉树的邻接矩阵,用来并行计算各个结点的左右子树上子孙结点的数目,并行解决二叉树的A-序和B-序问题,并以实例证明该方法的有效性。Adjacency matrices of trees are researched, and some characteristics of trees are summed up. Adjacency matrices can be used to store trees, to get the degree of each node and to judge whether it is leaf node or not easily, and also used to compute the sum of posterity nodes of each node. Specially, adjacency matrices of binary trees are discussed, they can be used to compute the sum of posterity nodes on left or right son--tree of each node in parallel, and get the A--sequences and B--sequences of binary trees in parallel.

关 键 词：树 邻接矩阵 A-序 B-序 

分 类 号：TP399[自动化与计算机技术—计算机应用技术]