Optimum Cover Set between Two Arbitrary Nodes in Topological Network Structure

in order to find out the path fault between two arbitrary nodes in topological network structure,this paper presents the path-tree and the minimal cover subtree growth-regression ajgorithm.which can be applied to span automatically the optimum cover set.thus provides for the network administrater the basis of diagnosesing path faults of the network.