接近一年没做题差不多都忘干净了
想复习算法没板子
回头找之前做过的题代码跟shit一样自己都看不懂
从头写吧
Dijkstra最短路
去年省赛考了个最短路结果Floyd都没想起来白给一个填空,干脆直接记Dijkstra省的时间来不及
例题用了sdut oj的图结构练习——最短路径
java代码
import java.io.*;
import java.util.*;
public class Main {
static Scanner tab = new Scanner(System.in);
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
static int N = 110;
static int e[][] = new int[N][N]; // 边权值
static int dist[] = new int[N]; // 到各点的最短距离 选定一个起点因此一维
static boolean st[] = new boolean[N]; // 判断每个点是否已获得最短路
static int inf = 999999;
// 传参 共n个点
static int dijkstra(int n) {
// 起点标记为已确定
st[1] = true;
// 除起点外共n-1个点,因此循环n-1次
for (int k = 1; k < n; k++) {
// 找出当前未确定集合中dist最短的点
int min_dist = inf;
int min_point = inf;
for (int i = 1; i <= n; i++) {
if (dist[i] < min_dist && !st[i]) {
min_dist = dist[i];
min_point = i;
}
}
// 标记该点为已确定
st[min_point] = true;
// 松弛,即能否通过正在确定的点获得更短的dist
for (int i = 1; i <= n; i++) {
if(!st[i]) {
dist[i] = Math.min(dist[i], dist[min_point] + e[min_point][i]);
}
}
}
// 返回目标点(n)
return dist[n];
}
public static void main(String[] args) throws IOException {
while (tab.hasNext()) {
// 初始化
for (int i = 0; i < N; i++) {
Arrays.fill(e[i], inf);
}
Arrays.fill(dist, 0);
Arrays.fill(st, false);
int n = tab.nextInt();
int m = tab.nextInt();
for (int i = 1; i <= n; i++) {
e[i][i] = 0;
}
while (m-- > 0) {
int u = tab.nextInt();
int v = tab.nextInt();
int c = tab.nextInt();
// 此题两点间可能有多条路径
if(e[u][v] > c)
e[u][v] = e[v][u] = c;
}
// dist初始化
for (int i = 1; i <= n; i++) {
dist[i] = e[1][i];
}
int ans = dijkstra(n);
System.out.println(ans);
}
}
}