计算全部树的撕裂算法

AN RIPPING ARITHMETIC TO COUNT ALL TREES

提出一种求连通图的全部树的方法，该方法采用撕裂大图分为两个连通片，然后添加撕裂边，便生成全部生成树．该方法可用于计算机并行运算，适用于大网络的计算机辅助分析．

The paper presents a method to generate all possible spanning trees of a connected linear graph. By tearing a big connected linear graph into two pieces and then adding border lines one by one we can generate all possible spanning trees. This method be suitable for to computer parallel computation and computer aided analysis of a large network.