New Commit

Author: coder-mayank22

Bellman_Ford.c

@@ -0,0 +1,2 @@
+#include<stdio.h>
+#include<stdlib.h>

Prim's_algo.c

@@ -3,7 +3,7 @@
 #include<string.h>
 
 #define INF 9999999
-#define V 5
+#define V 6
 
 //The adjacency matrix
 /*int G[V][V] = {
@@ -16,7 +16,7 @@
 
 void addEdge(int u, int v, int adjMatrix[V][V]){
 	int w;
-	printf("Enter weight of edge between %d and %d : ", u, v);
+	printf("Enter weight of edge between %d and %d : ", u+1, v+1);
 	scanf("%d", &w);
 	adjMatrix[u][v] = w;
 	adjMatrix[v][u] = w;
@@ -75,7 +75,7 @@ int main(){
 				}
 			}
 		}
-		printf("%d - %d : %d\n", x, y, G[x][y]);
+		printf("%d - %d : %d\n", x+1, y+1, G[x][y]);
 		sum += G[x][y];
 		selected[y] = true;
 		no_edge++;

Prim's_algo.exe

@@ -1,36 +1,31 @@
 #include<stdio.h>
 #define inf 99999
 int n;
-int Chain_multi(int P[], int s[n-1][n-1], int n) // P is the array of dimensions
+int Chain_multi(int P[], int n) // P is the array of dimensions
 {
     int m[n][n];
- 
     int i, j, k, L, q;
- 
-    // cost is zero when multiplying one matrix.
+
     for (i = 1; i < n; i++)
         m[i][i] = 0;
 
-    // L is chain length.
     for (L = 2; L < n; L++) {
         for (i = 1; i < n - L + 1; i++) 
         {
             j = i + L - 1;
             m[i][j] = inf;
-
             for (k = i; k <= j - 1; k++) 
             {
                 // q = cost/scalar multiplications
-                q = m[i][k] + m[k + 1][j] + P[i - 1] * P[k] * P[j];
+                q = m[i][k] + m[k + 1][j]
+                    + P[i - 1] * P[k] * P[j];
                 if (q < m[i][j])
                     m[i][j] = q;
-                    s[i][j] = k;
             }
         }
     }
 
     return m[1][n - 1];
-    // return m;
 }
 
 void print_Optimal_parens(int s[n-1][n-1], int i, int j){
@@ -52,21 +47,17 @@ int main(){
     printf("Enter dimensions of the matrices\n");
     for(i=0;i<n;i++){
         printf("Matrix A%d: ", i+1);
-        scanf("%d %d", dim1, dim2);
-        /*if(!P[i])   //prevents overriding
-        {
-            P[i] = dim1;
-            P[i+1] = dim2;
-        }
-        else
-            P[i+1] = dim2;*/
+        scanf("%d %d", &dim1, &dim2);
+        
         P[i] = dim1;
         P[i+1] = dim2;
     }
 
+    for(i = 0; i<n+1; i++)printf("%d ", P[i]);
+    printf("\n");
     int s[n-1][n-1];
-    int m = Chain_multi(P, s, n);
+    int m = Chain_multi(P, n+1);
     printf("\nMinimum number of multiplications = %d\n", m);
-    print_Optimal_parens(s, 1, n);
+    // print_Optimal_parens(s, 1, n);
     return 0;
 }