java实现 库鲁斯卡尔算法kruskal(算法设计与分析作业)
package package1;
import java.util.Arrays;
public class alg {
public static boolean isIn(int[] nums, int tar) {
for (int n : nums) {
if (tar == n) {
return true;
}
}
return false;
}
public static void sortG(int[][] g) {
for (int i = 0; i < g.length - 1; i++) {
for (int j = 0; j < g.length - 1 - i; j++) {
if (g[j][2] > g[j + 1][2]) {
int[] t = g[j];
g[j] = g[j + 1];
g[j + 1] = t;
}
}
}
System.out.printf("---------------%s------------------\n", "排序后");
for (int[] i : g) {
System.out.println