多源最短路径之Floyd 算法的简单实现

基本思想

1. 通过Floyd计算图G=(V,E)中各个顶点的最短路径时，需要引入一个矩阵S，矩阵S中的元素a[i][j]表示顶点i(第i个顶点)到顶点j(第j个顶点)的距离；
2. 假设图G中顶点个数为N，则需要对矩阵S进行N次更新。初始时，矩阵S中顶点a[i][j]的距离为顶点i到顶点j的权值；如果i和j不相邻，则a[i][j]=∞。 接下来开始，对矩阵S进行N次更新。第1次更新时，如果"a[i][j]的距离" > “a[i][0]+a[0][j]”(a[i][0]+a[0][j]表示"i与j之间经过第1个顶点的距离")，则更新a[i][j]为"a[i][0]+a[0][j]"。 同理，第k次更新时，如果"a[i][j]的距离" > “a[i][k]+a[k][j]”，则更新a[i][j]为"a[i][k]+a[k][j]"。更新N次之后，操作完成；
3. 路径必定由两段最短路径组成；
4. T=o(|v|^3);

代码：

public class Floyd {

	private String[] vertices1;
	private int[] vertices;
	private int[][] matrix;
//	private int[][] weight;
	private static final int INF = Integer.MAX_VALUE;
	int[][] path;

	public Floyd(int vlen) {
		vertices = new int[vlen];
		matrix = new int[vlen][vlen];
		path = new int[vlen][vlen];
		vertices1 = new String[vlen];
//		weight = new int[vlen][vlen];

		for (int i = 0; i < vlen; i++) {
			for (int j = 0; j < vlen; j++) {
				if (i == j)
					matrix[i][j] = 0;
				else
					matrix[i][j] = INF;
			}
		}
	}

	public int[][] floyd(String[] vertices1, int[][] dist) {

		for (int i = 0; i < vertices.length; i++) {
			for (int j = 0; j < vertices.length; j++) {
				// dist[i][j] = matrix[i][j];
				path[i][j] = j;
			}
		}
		for (int k = 0; k < vertices.length; k++) {
			for (int i = 0; i < vertices.length; i++) {
				for (int j = 0; j < vertices.length; j++) {
					int temp = (dist[i][k] == INF || dist[k][j] == INF) ? INF : (dist[i][k] + dist[k][j]);
					if (dist[i][j] > temp) {
						dist[i][j] = temp;
						path[i][j] = path[i][k];
					}
				}
			}
		}
		
		return dist;
	}

	public void two_points(String ch1, String ch2) {
		int i = 0;
		int j = 0;
		for (int k = 0; k < vertices.length; k++) {

			if (vertices1[k].equals(ch1)) {
				i = k;
			}
			if (vertices1[k].equals(ch2)) {
				j = k;
			}
		}
		System.out.println(vertices1[i]);
		System.out.println(vertices1[path[i][j]]);
		int temp = path[i][j];
		while (temp != j) {

			System.out.println(vertices1[path[temp][j]]);
			temp = path[temp][j];
		}
	}

	public void print(int[][] dist) {
		for (int i = 0; i < vertices.length; i++) {
			for (int j = 0; j < vertices.length; j++) {
				System.out.printf("%4d", dist[i][j]);
			}
			System.out.println();
		}

		for (int i = 0; i < vertices.length; i++) {
			for (int j = 0; j < vertices.length; j++) {
				System.out.printf("%2d\t", path[i][j]);
			}
			System.out.println();
		}
	}

	public String[] readChar1() {
		System.out.println("请输入顶点");
		@SuppressWarnings("resource")
		Scanner ch = new Scanner(System.in);
		for (int i = 0; i < vertices.length; i++) {
			vertices1[i] = ch.nextLine();
		}
		return vertices1;
	}

	public String readChar2() {
		System.out.println("请输入图中任意两顶点");
		@SuppressWarnings("resource")
		Scanner scan = new Scanner(System.in);
		String ch = scan.nextLine();
		return ch;
	}

	public int[][] readInt() {
		System.out.println("请输入邻接矩阵");
		@SuppressWarnings("resource")
		Scanner scan = new Scanner(System.in);

		for (int i = 0; i < vertices.length; i++) {
			for (int j = 0; j < vertices.length; j++) {
				matrix[i][j] = scan.nextInt();
			}
		}
		return matrix;
	}

	public static void main(String[] args) {
		int[][] weight = { { 0, 12, INF, INF, INF, 16, 14 }, { 12, 0, 10, INF, INF, 7, INF },
				{ INF, 10, 0, 3, 5, 6, INF }, { INF, INF, 3, 0, 4, INF, INF }, { INF, INF, 5, 4, 0, 2, 8 },
				{ 16, 7, 6, INF, 2, 0, 9 }, { 14, INF, INF, INF, 8, 9, 0 } };

		Floyd test = new Floyd(7);
		// test.floyd(test.readChar1(), weight);
		test.print(test.floyd(test.readChar1(), weight));
		test.two_points(test.readChar2(), test.readChar2());
	}
}