diff --git a/parallel.cu b/parallel.cu
index db93c31255952df5fbc20b83506014897db4b65e..bbe914f34a3c6f5b33d14a50b0d67eba338ba804 100644
--- a/parallel.cu
+++ b/parallel.cu
@@ -18,8 +18,6 @@ void write_output(long matrix[], int n_row, int n_col, double time);
 
 __global__
 void dijkstra(int n, long matrix[], long result[]) {
-    printf("Djikstra summoned");
-
 	long *connected;         // Array of 'boolean' on whether vertice [i] is connected to source
     long *distance;          // Distance of vertice [i] from source
 
@@ -29,11 +27,7 @@ void dijkstra(int n, long matrix[], long result[]) {
 	connected = (long*)malloc(n * sizeof(long));
     distance = (long *)malloc(n * sizeof(long));
 
-    printf("rank %d of n %d", my_rank, n);
-
 	for (int SOURCE_V = my_rank; SOURCE_V < n; SOURCE_V += stride) {
-        printf("Now processing for vertice %d.", SOURCE_V);
-
         for (int i = 0; i < n; i++) {
             if (i == SOURCE_V) {
                 connected[i] = TRUE;
@@ -86,7 +80,7 @@ void dijkstra(int n, long matrix[], long result[]) {
 
 int main (int argc, char **argv) {
     long *matrix, *result;          // Matrix size i * j of distance from vertice [i] to vertice [j]
-    int n, jmlBlock;                          // Number of vertices
+    int n;                          // Number of vertices
     // int my_rank, thread_count, sub_n;
     clock_t start, end;
     double cpu_time_used;
@@ -99,16 +93,9 @@ int main (int argc, char **argv) {
 
     result = initialize_result(n);
 
-    if (n <=512) {
-        jmlBlock = n;
-    }
-    else {
-        jmlBlock = 512;
-    }
-
     start = clock();
 	
-	dijkstra<<<jmlBlock,1>>>(n, matrix, result);
+	dijkstra<<<n,1>>>(n, matrix, result);
 
     cudaDeviceSynchronize();