Description: based T is a right to bring a tree for every one of the sideband is the right one. S is also based Vertex Set T, T/S from the tree T Lieutenant General S vertex deletion the forest. If the T/S all trees from the roots to leaves of a long road, do not exceed d, said the T/S is a d forest. (1) design a T algorithm for the minimum vertex set S, T/S is d forest. (Tip : from roots to leaves mobile) (2) analysis algorithm correctness and computational complexity. (3) The T with n vertices, the algorithm complexity of computing time for the O (n).
File list (Check if you may need any files):
Download