public class Dijkstra {
	public static void main(String[] args) {
		// input example
		int[][] inputGraph = { { 0, 4, 6, 0, 0 }, { 0, 0, 1, 2, 4 }, { 0, 1, 0, 0, 2 }, {2,0,0,0,0}, {0,0,0,2,0} };
		
		System.out.println(Arrays.toString(dijkstra(inputGraph,0)));
	}

	public static int[] dijkstra(int[][] adjacencyMatrix, int start) {
		int numberVertices = adjacencyMatrix.length;
		int[] currentShortestPath = new int[numberVertices];
		boolean[] visitedVertices = new boolean[numberVertices];
		//TODO
	}
}