学了这两种算法,总觉得还没完全体会,体会两种方法的不同,我个人喜爱用Kruskal算法,因为它不像prim算法那样还要初始化,for语句也要小一些,看起来比prim算法更整洁。
下面以poj1287为列:
Description
You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect pairs of points. For each possible route between two points, you are given the length of the cable that is needed to connect the points over that route. Note that there may exist many possible routes between two given points. It is assumed that the given possible routes connect (directly or indirectly) each two p