Untitled
unknown
plain_text
2 months ago
527 B
1
Indexable
#define V 9 int minDistance(int dist[], int sptSet[]) { int min = INT_MAX, min_index; for (int v = 0; v < V; v++) { if (sptSet[v] == 0 && dist[v] <= min) { min = dist[v]; min_index = v; } } return min_index; } void dijkstra(int graph[V][V], int src) { int dist[V]; int sptSet[V]; for (int i = 0; i < V; i++) { dist[i] = INT_MAX; sptSet[i] = 0; } dist[src] = 0; for (int count = 0; count < V - 1; count++) { int u = minDistance(dist, sptSet); sptSet[u] = 1; for (int v = 0; v < V; v++) {
Editor is loading...
Leave a Comment