Let G2 be a spanning tree of G1 , namely , a minimal connected graph on K1 , ... ... In addition , the total length lol of o is at most n – 2 , and skel D ...
確定! 回上一頁