本文根据国的基本回路特性(或基本割集特性),提出了以连支组合替代基本回路中非相关树支组合的方式来进行树的基本变换,从而得到一种求树的新算法.新算法的运算分组进行,且在每组运算中应用王氏代数来筛除相关树支.本算法具有系统性强、易编程上机、节省存贮空间和计算时间、步骤简明等特点. In this paper, based on the basic circuit characteristics (or the basic cut set characteristics) in our country, we propose a new algorithm to find the tree by using the combination of branch and branch to replace the non-related tree branch combination in the basic circuit. The algorithms are grouped into groups, and Wang’s algebra is used in each group of operations to filter out the related tree branches. This algorithm has the characteristics of strong systematicness, easy programming on the machine, saving storage space and computing time, and simple steps.