要求对一个图使用kruskal算法求最小生成树，依次输出选出的边所关联的顶点序列，要求下标较小者在前。

1.最小路径覆盖==  总顶点数 - 最大匹配数 2.最小点覆盖==最大匹配数 3.最大独立集==总节点数-最大匹配数

  As we all know, machine scheduling is a very classical problem in computer science and has been studied…

In Diagon Alley ,there is only one Wand-seller,peeling gold letters over the door read Ollivanders: Makers of …

the second year of the university somebody started a study on the romantic relations between the students. The…

You are to write a program that tries to find an optimal coloring for a given graph. Colors are applied to the…

传送门 An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless…

传送门：点击这里 Problem Description Betty owns a lot of ponds, some of them are connected with other ponds by pipes, …