class Dijkstra { static int V; // finds the node with min distance to the made tree up to now int minDistance(int dist[], Boolean usedset[]) { int min = Integer.MAX_VALUE, min_index = -1; for (int v = 0; v < V; v++) { if (usedset[v] == false && dist[v] <= min) { min = dist[v]; min_index = v; } } return min_index; } // main function, starts from source, and adds nodes with min distance and changes their distance upon new node that has a way to any part of the made tree if needed void dijkstra(int graph[][], int src) { V = graph.length; int dist[] = new int[V]; Boolean[] usedset = new Boolean[V]; for (int i = 0; i < V; i++) { dist[i] = Integer.MAX_VALUE; usedset[i] = false; } dist[src] = 0; boolean graph2[][]=new boolean[graph.length][graph.length]; for (int count = 0; count < V - 1; count++) { int u = minDistance(dist, usedset); usedset[u] = true; for (int v = 0; v < V; v++) { if (!usedset[v] && graph[u][v] != 0 && dist[u] + graph[u][v] < dist[v]) { dist[v] = dist[u] + graph[u][v]; graph2[u][v]=true; } } } printSolution(dist, V); // also for the source 0 gives the vertexes used in the min tree if (src == 0 ){ for (int i =0;i

Dijkstra algorithm