WebSVN – programming – Diff – /school/cs370/proj3/proj3_10.c

+/* proj3_10.c - implements the APSP algorithm for a matrix of size 10x10
+ *              as provided in the project description.
+ *
+ * Copyright (c) 2006, Ira W. Snyder (devel@irasnyder.com)
+ */
 #include <stdio.h>
 #include <limits.h>
 #include <mpi.h>
 const int ROOT_NODE = 0;
+    }
+}
 int main (int argc, char *argv[])
+{
-    const int n = 4;
+    const int n = 10;
     int *b, *c;
     int i, j, k, temp, t;
     MPI_Status status;
     /* Get all of the necessary info for each process */
         /* Initialize values */
         for (i=0; i<n; i++)
             for (j=0; j<n; j++)
                 b[i*n+j] = INT_MAX;
-        b[0] = 0;
+        b[1] = 3;
-        b[1] = 2;
+        b[2] = 2;
+        b[5] = 5;
+        b[6] = 4;
+        b[7] = 9;
-        b[2] = INT_MAX;
+        b[8] = 1;
-        b[3] = 10;
+        b[9] = 15;
+        b[10] = 3;
+        b[12] = 4;
+        b[13] = 7;
-        b[4] = 2;
+        b[14] = 28;
+        b[16] = 2;
+        b[17] = 9;
+        b[19] = 1;
+        b[20] = 2;
+        b[21] = 4;
+        b[24] = 3;
+        b[25] = 12;
+        b[26] = 5;
+        b[28] = 10;
+        b[29] = 4;
+        b[31] = 7;
+        b[34] = 15;
-        b[5] = 0;
+        b[35] = 6;
-        b[6] = 2;
+        b[36] = 2;
-        b[7] = INT_MAX;
+        b[37] = 5;
+        b[41] = 28;
+        b[42] = 3;
+        b[43] = 15;
+        b[45] = 1;
+        b[46] = 3;
-        b[8]  = INT_MAX;
+        b[48] = 2;
-        b[9]  = 2;
+        b[49] = 9;
-        b[10] = 0;
+        b[50] = 5;
+        b[52] = 12;
+        b[53] = 6;
+        b[54] = 1;
-        b[11] = 3;
+        b[56] = 3;
+        b[58] = 2;
+        b[59] = 9;
+        b[60] = 4;
+        b[61] = 2;
+        b[62] = 5;
+        b[63] = 2;
+        b[64] = 3;
+        b[65] = 3;
+        b[67] = 1;
+        b[69] = 4;
+        b[70] = 9;
+        b[71] = 9;
+        b[73] = 5;
+        b[76] = 1;
+        b[78] = 7;
+        b[79] = 2;
+        b[80] = 1;
-        b[12] = 10;
+        b[82] = 10;
+        b[84] = 4;
+        b[85] = 2;
+        b[87] = 7;
+        b[89] = 4;
-        b[13] = INT_MAX;
+        b[90] = 15;
+        b[91] = 1;
+        b[92] = 4;
-        b[14] = 3;
+        b[94] = 7;
-        b[15] = 0;
+        b[95] = 9;
+        b[96] = 4;
+        b[97] = 2;
+        b[98] = 4;
+        /* Force b[i][i] = 0 */
+        for (i=0; i<n; i++)
+            b[i*n+i] = 0;
         if (n<=100)
             print_matrix (b, n, "Input Matrix:");
         else
+        {

Subversion Repositories programming

(root)/school/cs370/proj3/proj3_10.c – Rev 326 → 327