DijkstraAlgorithm

public class DijkstraAlgorithm {
    static final int totalVertex = 9;

    int minimumDistance(int distance[], Boolean included[]) {
        int m = Integer.MAX_VALUE, m_index = -1;

        for (int i = 0; i < totalVertex; i++) {
            if (included[i] == false && distance[i] < m) {
                m = distance[i];
                m_index = i;
            }
        }
        return m_index;
    }

    void printSolution(int distance[], int n) {
        System.out.println("The shortest distance from source node to all other nodes are:");
        for (int j = 0; j < n; j++) {
            System.out.println("The shortest distance to" + " " + j + " " + "is:" + distance[j]);
        }
    }

    void dijkstra(int graph[][], int s) {
        int distance[] = new int[totalVertex];
        Boolean included[] = new Boolean[totalVertex];

        for (int j = 0; j < totalVertex; j++) {
            distance[j] = Integer.MAX_VALUE;
            included[j] = false;
        }

        distance[s] = 0;

        for (int cnt = 0; cnt < totalVertex - 1; cnt++) {
            int ux = minimumDistance(distance, included);
            included[ux] = true;

            for (int vx = 0; vx < totalVertex; vx++) {
                if (!included[vx] && graph[ux][vx] != -1 && distance[ux] != Integer.MAX_VALUE
                        && distance[ux] + graph[ux][vx] < distance[vx]) {
                    distance[vx] = distance[ux] + graph[ux][vx];
                }
            }
        }

        printSolution(distance, totalVertex);
    }

    public static void main(String[] args) {
        int grph[][] = new int[][] { { -1, 3, -1, -1, -1, -1, -1, 7, -1 }, { 3, -1, 7, -1, -1, -1, -1, 10, 4 },
                { -1, 7, -1, 6, -1, 2, -1, -1, 1 }, { -1, -1, 6, -1, 8, 13, -1, -1, 3 },
                { -1, -1, -1, 8, -1, 9, -1, -1, -1 }, { -1, -1, 2, 13, 9, -1, 4, -1, 5 },
                { -1, -1, -1, -1, -1, 4, -1, 2, 5 }, { 7, 10, -1, -1, -1, -1, 2, -1, 6 },
                { -1, 4, 1, 3, -1, 5, 5, 6, -1 } };
        DijkstraAlgorithm obj = new DijkstraAlgorithm();
        obj.dijkstra(grph, 0);
    }
}