dijkstra 27s weighted graph shortest path in c 2b 2b

1#include <limits.h> 
2#include <stdio.h> 
3  
4
5#define V 9 
6  
7
8int minDistance(int dist[], bool sptSet[]) 
9{ 
10
11    int min = INT_MAX, min_index; 
12  
13    for (int v = 0; v < V; v++) 
14        if (sptSet[v] == false && dist[v] <= min) 
15            min = dist[v], min_index = v; 
16  
17    return min_index; 
18} 
19  
20
21void printSolution(int dist[]) 
22{ 
23    printf("Vertex \t\t Distance from Source\n"); 
24    for (int i = 0; i < V; i++) 
25        printf("%d \t\t %d\n", i, dist[i]); 
26} 
27  
28
29void dijkstra(int graph[V][V], int src) 
30{ 
31    int dist[V]; 
32    
33  
34    bool sptSet[V];
35 
36    for (int i = 0; i < V; i++) 
37        dist[i] = INT_MAX, sptSet[i] = false; 
38  
39  
40    dist[src] = 0; 
41  
42  
43    for (int count = 0; count < V - 1; count++) { 
44       
45        int u = minDistance(dist, sptSet); 
46  
47       
48        sptSet[u] = true; 
49  
50       
51        for (int v = 0; v < V; v++) 
52  
53           
54            if (!sptSet[v] && graph[u][v] && dist[u] != INT_MAX 
55                && dist[u] + graph[u][v] < dist[v]) 
56                dist[v] = dist[u] + graph[u][v]; 
57    } 
58  
59 
60    printSolution(dist); 
61} 
62  
63
64int main() 
65{ 
66    
67    int graph[V][V] = { { 0, 4, 0, 0, 0, 0, 0, 8, 0 }, 
68                        { 4, 0, 8, 0, 0, 0, 0, 11, 0 }, 
69                        { 0, 8, 0, 7, 0, 4, 0, 0, 2 }, 
70                        { 0, 0, 7, 0, 9, 14, 0, 0, 0 }, 
71                        { 0, 0, 0, 9, 0, 10, 0, 0, 0 }, 
72                        { 0, 0, 4, 14, 10, 0, 2, 0, 0 }, 
73                        { 0, 0, 0, 0, 0, 2, 0, 1, 6 }, 
74                        { 8, 11, 0, 0, 0, 0, 1, 0, 7 }, 
75                        { 0, 0, 2, 0, 0, 0, 6, 7, 0 } }; 
76  
77    dijkstra(graph, 0); 
78  
79    return 0; 
80}