图最短距离

package com.test;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class GraphTest {

	static final int m = Integer.MAX_VALUE >> 4; // 无限大距离
	
	public static void main(String[] args) {
		int[][] arr = new int[8][8];
		init(arr);
		List<PathNode> list = getShortDistance(arr,4);
		//最短路径暂时先不求解了
		list.forEach(o -> System.out.println(o));
	}

	static class PathNode{
		char c;
		List<Character> shortestPath = new ArrayList<>();
		int shortestDistince = m;
		boolean isIterator = false;
		@Override
		public String toString() {
			return "PathNode [c=" + c + ", shortestPath=" + shortestPath + ", shortestDistince=" + shortestDistince
					+ "]";
		}
	}
	
	private static List<PathNode> getShortDistance(int[][] arr , int from) {
		List<PathNode> pns = new ArrayList<>();
		Map<Integer,PathNode> cmap = new HashMap<>();
		int length = arr.length;
		for(int i=0;i<length;i++){
			if(i != from){
				PathNode pn = new PathNode();
				pn.c = (char)(i+65);
				pn.shortestPath.add((char)(from+65));
				cmap.put(i, pn);
				pns.add(pn);
			}
		}
		int i = from;
		int min = 0;
		for(;;){
		  for(int j=0; j<length ; j++){
			if(i == j || j == from)
				 continue;
			 int a = arr[i][j] + min;
			 int b = cmap.get(j).shortestDistince;
			 if(a < b){
				 cmap.get(j).shortestDistince = a;
			 }
		  }
		  //找到最短距离的节点，即下一趟要遍历的节点
		  min = m;
		  for(PathNode pn : pns){
			  if(!pn.isIterator && pn.shortestDistince < min){
				  min = pn.shortestDistince;
				  i = pn.c - 65;
			  }
		  }
		  if(min == m)
			  break;
		  else
			  cmap.get(i).isIterator = true;
		}
		return pns;
	}


	private static void init(int[][] arr) {
		arr[0][0] = 0;
		arr[0][1] = 20;
		arr[0][2] = m;
		arr[0][3] = 80;
		arr[0][4] = m;
		arr[0][5] = m;
		arr[0][6] = 90;
		arr[0][7] = m;
		
		arr[1][0] = m;
		arr[1][1] = 0;
		arr[1][2] = m;
		arr[1][3] = m;
		arr[1][4] = m;
		arr[1][5] = 10;
		arr[1][6] = m;
		arr[1][7] = m;
		
		arr[2][0] = m;
		arr[2][1] = m;
		arr[2][2] = 0;
		arr[2][3] = 10;
		arr[2][4] = m;
		arr[2][5] = 50;
		arr[2][6] = m;
		arr[2][7] = 20;
		
		arr[3][0] = m;
		arr[3][1] = m;
		arr[3][2] = 10;
		arr[3][3] = 0;
		arr[3][4] = m;
		arr[3][5] = m;
		arr[3][6] = 20;
		arr[3][7] = m;
		
		arr[4][0] = m;
		arr[4][1] = 50;
		arr[4][2] = m;
		arr[4][3] = m;
		arr[4][4] = 0;
		arr[4][5] = m;
		arr[4][6] = 30;
		arr[4][7] = m;
		
		arr[5][0] = m;
		arr[5][1] = m;
		arr[5][2] = 10;
		arr[5][3] = 40;
		arr[5][4] = m;
		arr[5][5] = 0;
		arr[5][6] = m;
		arr[5][7] = m;
		
		arr[6][0] = 20;
		arr[6][1] = m;
		arr[6][2] = m;
		arr[6][3] = m;
		arr[6][4] = m;
		arr[6][5] = m;
		arr[6][6] = 0;
		arr[6][7] = m;
		
		arr[7][0] = m;
		arr[7][1] = m;
		arr[7][2] = m;
		arr[7][3] = m;
		arr[7][4] = m;
		arr[7][5] = m;
		arr[7][6] = m;
		arr[7][7] = 0;		
	}
}