import java.util.ArrayList;

public class shortest {
	// https://pastebin.com/nzSf9j4s
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		int[][] graph= {
				{0, 6, 3, 0, 0, 0}, 
				{6, 0, 3, 4, 0, 0},
				{3, 3, 0, 5, 4, 0},
				{0, 4, 5, 0, 2, 1}, 
				{0, 0, 4, 2, 0, 4}, 
				{0, 0, 0, 1, 4, 0}
		};
		
		shortestPath(graph,0);

	}
	
	public static void shortestPath(int[][]graph,int startingNode) {
		int[] distance=new int[graph.length];
		for(int i=0;i<distance.length;i++) {
			distance[i]=Integer.MAX_VALUE;
		}
		distance[0]=0;
		
		ArrayList<Integer> visitedNode=new ArrayList<Integer>();
		visitedNode.add(startingNode);
	}

}