Method minDist

Programs/Dijkstra.java:51–61

(int dist[], boolean[] visited)

    }

    private static int minDist(int dist[], boolean[] visited){
        int min = Integer.MAX_VALUE, min_index = -1;

        for(int i = 0 ; i < dist.length; i++){
            if(!visited[i] && dist[i] <= min){
                min = dist[i];
                min_index = i;
            }
        }
        return min_index;
    }
}