在看代码前,可以先参考SPFA的强大详解,我也是看了它才做出来这题的,嘻嘻
http://blog.csdn.net/muxidreamtohit/article/details/7894298
效率并不是很高,请多多指教
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.Queue;
//顶点类
class Vexs {
int v;// 当前顶点要到达v顶点,v是目标的索引
int weight;// 当前顶点到v顶点的权值weight
Vexs next;// 当前顶点的下一个顶点
public Vexs(int v, int weight) {
this.v = v;
this.weight = weight;
}
public Vexs() {}
}
public class SPFA_ShortestPath {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String order[] = br.readLine().split(" ");
int n = Integer.parseInt(order[0]), m = Integer.parseInt(order[1]);
Vexs[] vs = new Vexs[n + 1];// 存放顶点的数组
int[] minpath = new int[n + 1];// 存放起始顶点到达各个顶点的最短路径的数组
boolean visited[] = new boolean[n + 1];// 用于记录哪些顶点是在队里,false不在队里,true在队里
// 初始化
for (int i = 2; i < minpath.length; i++)
minpath[i] = Integer.MAX_VALUE;
// 初始化
for (int i = 1; i < vs.length; i++)
vs[i] = new Vexs();
// 初始化
for (int i = 0; i < m; i++) {
String data[] = br.readLine().split(" ");
int u = Integer.parseInt(data[0]);
int v = Integer.parseInt(data[1]);
int w = Integer.parseInt(data[2]);
Vexs vo = vs[u];
while (vo.next != null)
vo = vo.next;
vo.next = new Vexs(v, w);
}
// 存放顶点的索引
Queue<Integer> queue = new LinkedList<Integer>();
queue.offer(1);
while (!queue.isEmpty()) {
int u = queue.poll();// 队列的对头元素出队
Vexs to = vs[u].next;// 获取到第一个与顶点u相连接的顶点
visited[u] = false;// u顶点出队了,改成false状态
while (to != null) {
// 判断顶点u到顶点to.v是否有更短的路径
/*
* minpath[u]:是起始顶点(1)到达顶点u的最短路径
* to.weight:是顶点u到达顶点to.v的路径
* (minpath[to.v]:是起始顶点到达顶点to.v目前最短路径
*/
if (minpath[to.v] > minpath[u] + to.weight) {
minpath[to.v] = minpath[u] + to.weight;
// 判断to.v顶点是否在queue队里边,如果没有就入队
if (!visited[to.v]) {
queue.offer(to.v);// 入队
visited[to.v] = true;// 在队状态
}
}
to = to.next;
}
}
for (int i = 2; i < minpath.length; i++) {
System.out.println(minpath[i]);
}
}
}