 
         time_t mark2 = time(NULL);
         printf("Done converting (%ds).\n", (int)(mark2 - mark1));
-        
+
         // Write offsets, indices, node, edges etc. into file
         if (LOAD_EDGE_VALUES)
 	{
-	  WriteToFile(output_file, 
-		      undirected, 
-		      reversed, 
-		      nodes, 
-		      edges, 
-		      row_offsets, 
-		      column_indices, 
+	  WriteToFile(output_file,
+		      undirected,
+		      reversed,
+		      nodes,
+		      edges,
+		      row_offsets,
+		      column_indices,
 		      edge_values);
         }
         else
         {
-	  WriteToFile(output_file, 
-		      undirected, 
+	  WriteToFile(output_file,
+		      undirected,
 		      reversed,
-		      nodes, 
-		      edges, 
-		      row_offsets, 
+		      nodes,
+		      edges,
+		      row_offsets,
 		      column_indices);
         }
 

        }
        printf("\nDegree Histogram (%lld vertices, %lld directed edges):\n",
               (long long) nodes, (long long) edges);
			   
        printf("\tDegree   0: %d (%.2f%%)\n", log_counts[0],
               (float) log_counts[0] * 100.0 / nodes);
        for (int i = 0; i < max_log_length + 1; i++) {

        }

        Tuple *new_coo = (Tuple*) malloc(sizeof(Tuple) * coo_edges);
        SizeT real_edge = 0;
        if (coo[0].col != coo[0].row) {
          new_coo[0].row = coo[0].row;
          new_coo[0].col = coo[0].col;
          new_coo[0].val = coo[0].val;
          real_edge++;
        }
        for (int i = 0; i < coo_edges-1; ++i)
        {
            if (((coo[i+1].col != coo[i].col) || (coo[i+1].row != coo[i].row)) && (coo[i+1].col != coo[i+1].row))
