POJ2472 分别用dijstra spfa实现

传送门

这个题本质水题，但是却是一道十分经典的最短路径题，我分别用floyd dijstra spfa实现了一次，数据结构分别采别用了邻接链表和邻接矩阵，对于提高几种算法的理解很有帮助。floyd的版本手误删没了，下面就只贴出来dijstra和spfa的AC代码。

1.dijstra java实现

import java.text.DecimalFormat;
import java.util.*;
/*
 * dijstra
 */
public class Main{
	static double[][] map = new double[101][101];
	static int n,m;
	static int x,y;
	static double pro;
	static void dijstra() {
		double[] dis = new double[101];
		boolean[] vis = new boolean[101];
		for(int i = 1;i<=n;i++) {
			dis[i] = map[1][i];
			//vis[i] = false;
		}
		vis[1] = true;
		dis[1] = 1.0;
		for(int i = 2;i<=n;i++) {
			int k = 0;
			double max = 0.0;
			for(int j = 2;j<=n;j++) {
				if(!vis[j]&&dis[j]>max) {
					max = dis[j];
					k = j;
				}
			}
			vis[k] = true;
			for(int j = 2;j<=n;j++) {
				if(!vis[j]&&dis[j]<dis[k]*map[k][j]) {
					dis[j] = dis[k]*map[k][j];
				}
			}
		}
		DecimalFormat f = new DecimalFormat("0.000000");
		System.out.print(f.format(dis[n]*100));
		System.out.println(" percent");
	}
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()) {
			n = sc.nextInt();
			if(n==0) break;
			m = sc.nextInt();
			for(int i = 1;i<=n;i++) {
				for(int j = 1;j<=n;j++) {
					map[i][j] = 0;
				}
			}
			for(int i = 1;i<=m;i++) {
				x = sc.nextInt();
				y = sc.nextInt();
				pro = (double)sc.nextInt()/100;
				map[x][y] = map[y][x] = pro;
			}
			dijstra();
		}
	}
}

2.spfa c++实现

#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
using namespace std;
double map[101][101];
int n,m;
int x,y;
int pro;
void spfa(){
    double dis[101];
    bool vis[101];
    queue<int> q;
    memset(dis,0, sizeof(dis));
    memset(vis,false, sizeof(vis));
    int newP = 1;
    vis[newP] = true;
    dis[newP] = 1.0;
    q.push(newP);
    while(!q.empty()){
        int tmp = q.front();
        q.pop();
        vis[tmp] = false;
        for(int i = 1;i<=n;i++){
            if(dis[i]<dis[tmp]*map[tmp][i]){
                dis[i] = dis[tmp]*map[tmp][i];
                if(!vis[i]){
                    q.push(i);
                    vis[i] = true;
                }
            }
        }
    }
    printf("%.6lf percent\n",dis[n]*100);
}
int main(){
    while(cin>>n&&n){
        cin>>m;
        memset(map,0, sizeof(map));
        for(int i = 0;i<m;i++){
            cin>>x>>y>>pro;
            map[x][y] = map[y][x] = (double)pro/100;
        }
        spfa();
    }
    return 0;
}

比较懒，没有注释，但是算法实现的还是中规中矩的，看不懂的话可以copy到本地调试着看，有误请各位大佬不吝赐教。