玖雨y的算法刷题记录day10——图论
- 题目链接:寻宝
- 题目思路:本题考查的是最小生成树算法,我将会给出Prim最小生成树和Kruskal最小生成树两个版本的代码,其中Prim算法的核心思想是每次都将距离生成树最近的节点入树,Kruskal算法的核心思想是将边排序,并基于并查集进行抉择每条边是否入树。
- Prim最小生成树算法
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int v = sc.nextInt();
int e = sc.nextInt();
int[][] grid = new int[v + 1][v + 1];
for (int i = 0; i <= v; i++) {
Arrays.fill(grid[i], 10001);
}
for (int i = 0; i < e; i++) {
int x = sc.nextInt();
int y = sc.nextInt();
int k = sc.nextInt();
grid[x][y] = k;
grid[y][x] = k;
}
int[] minDist = new int[v + 1];
Arrays.fill(minDist, 10001);
boolean[] isInTree = new boolean[v + 1];
for (int i = 1; i < v; i++) {
int cur = -1;
int minVal = Integer.MAX_VALUE;
for (int j = 1; j <= v; j++) {
if (!isInTree[j] && minDist[j] < minVal) {
minVal = minDist[j];
cur = j;
}
}
isInTree[cur] = true;
for (int j = 1; j <= v; j++) {
if (!isInTree[j] && grid[cur][j] < minDist[j]) {
minDist[j] = grid[cur][j];
}
}
}
int result = 0;
for (int i = 2; i <= v; i++) {
result += minDist[i];
}
System.out.println(result);
}
}
- Kruskal最小生成树算法
import java.util.*;
class Edge {
int l, r, val;
Edge(int l, int r, int val) {
this.l = l;
this.r = r;
this.val = val;
}
}
public class Main {
private static final int n = 10001;
private static final int[] father = new int[n];
public static void init() {
for (int i = 0; i < n; i++) {
father[i] = i;
}
}
public static int find(int u) {
if (u == father[u]) return u;
return father[u] = find(father[u]);
}
public static void join(int u, int v) {
u = find(u);
v = find(v);
if (u == v) return;
father[v] = u;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int v = sc.nextInt();
int e = sc.nextInt();
List<Edge> edges = new ArrayList<>();
int result_val = 0;
for (int i = 0; i < e; i++) {
int v1 = sc.nextInt();
int v2 = sc.nextInt();
int val = sc.nextInt();
edges.add(new Edge(v1, v2, val));
}
edges.sort(Comparator.comparingInt(edge -> edge.val));
init();
for (Edge edge : edges) {
int x = find(edge.l);
int y = find(edge.r);
if (x != y) {
result_val += edge.val;
join(x, y);
}
}
System.out.println(result_val);
}
}