     // 3-nodeand 4-node graphlet counts calculated as described
     // in http://nesreenahmed.com/publications/ahmed-et-al-icdm2015.pdf
     GRAPHLET_COUNTS counts = {0};
-    
+
     counts.g31 = aggregates.g31 / 3;
     counts.g32 = aggregates.g32 / 2;
     counts.g33 = aggregates.g33;

    }

    // Create one-dimensional blocks and grids based upon blocksize and gridsize
    dim3 dimBlock(blocksize, 1);
    dim3 dimGrid(gridsize, 1);

    // Execute CUDA kernel
    graphlets<<<dimGrid, dimBlock>>>(V_ptr, V_num, E_ptr, E_num, E_u_ptr, E_v_ptr, outputs_ptr);

    // Copy output data from GPU memory back into main memory

    int ei = E[i];

    // Lookup the endpoints of the current edge
    // TODO: Dynamically choose u to be the node with smallest neighborhood
    int u = E_u[ei];
    int v = E_v[ei];

