New Commit

Author: coder-mayank22

Djikstra_directed.c

@@ -0,0 +1,76 @@
+#include <stdio.h>
+#define INFINITY 9999
+#define MAX 10
+
+void Dijkstra(int Graph[MAX][MAX], int n, int start) {
+  int cost[MAX][MAX], distance[MAX], pred[MAX];
+  int visited[MAX], count, mindistance, nextnode, i, j;
+
+  // Creating cost matrix
+  for (i = 0; i < n; i++)
+    for (j = 0; j < n; j++){
+      if (Graph[i][j] == 0)
+        cost[i][j] = INFINITY;
+      else
+        cost[i][j] = Graph[i][j];
+    }
+  
+  for (i = 0; i < n; i++) {
+    distance[i] = cost[start][i];
+    pred[i] = start;
+    visited[i] = 0;
+  }
+
+  distance[start] = 0;
+  visited[start] = 1;
+  count = 1;
+
+  while (count < n - 1) {
+    mindistance = INFINITY;
+
+    for (i = 0; i < n; i++)
+      if (distance[i] < mindistance && !visited[i]) {
+        mindistance = distance[i];
+        nextnode = i;
+      }
+
+    visited[nextnode] = 1;
+    for (i = 0; i < n; i++)
+      if (!visited[i])
+        if (mindistance + cost[nextnode][i] < distance[i]) {
+          distance[i] = mindistance + cost[nextnode][i];
+          pred[i] = nextnode;
+        }
+    count++;
+  }
+
+  // Printing the distance
+  for (i = 0; i < n; i++)
+    if (i != start) {
+      printf("\nDistance from source to %d: %d", i, distance[i]);
+    }
+}
+int main() {
+  int Graph[MAX][MAX], i, j, u, v, n, edges;
+
+  printf("Enter number of vertices in the graph : ");
+  scanf("%d", &n);
+
+  printf("Enter number of edges in the graph: ");
+  scanf("%d", &edges);
+
+  for(i=0;i<edges;i++){
+    printf("From: ");
+    scanf("%d", &u);
+    printf("To: ");
+    scanf("%d", &v);
+    printf("Enter weight of edge from %d to %d: ", u, v);
+    scanf("%d", &Graph[u][v]);
+  }
+
+  printf("Enter source vertex : ");
+  scanf("%d", &u);
+  Dijkstra(Graph, n, u);
+
+  return 0;
+}