         }
         if (edge_values) { free (edge_values); edge_values = NULL; }
         if (node_values) { free (node_values); node_values = NULL; }
-        
+
         nodes = 0;
         edges = 0;
     }

        }

        Tuple *new_coo = (Tuple*) malloc(sizeof(Tuple) * coo_edges);
        SizeT real_edge = 1;
        new_coo[0].row = coo[0].row;
        new_coo[0].col = coo[0].col;
        new_coo[0].val = coo[0].val;
        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))


        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,
		      edge_values);
        }
        else
        {
	  WriteToFile(output_file,
		      undirected,
		      reversed,
		      nodes,
		      edges,
		      row_offsets,
		      column_indices);
        }

