   cpu_timer.Stop();
   float elapsed_cpu = cpu_timer.ElapsedMillis();
   printf("==> CPU Degree Centrality finished in %lf msec.\n", elapsed_cpu);
-  
+
   // clean up if neccessary
-  if (ref_degrees_n) { free(ref_degrees_n); } 
+  if (ref_degrees_n) { free(ref_degrees_n); }
   if (ref_degrees_r) { free(ref_degrees_r); }
   results.clear();
-  
+
 }
 
 /**

using namespace gunrock::app::topk;

/******************************************************************************
 * Defines, constants, globals 
 ******************************************************************************/
bool g_verbose;
bool g_undirected;

 ******************************************************************************/
void Usage()
{
  printf(
    "\ntest_topk <graph type> <graph type args> [--top=<K_value>] [--device=<device_index>] "
    "[--instrumented] [--quick] "
    "[--v]\n"
    "\n"
    "Graph types and args:\n"
    "  market [<file>]\n"
    "    Reads a Matrix-Market coordinate-formatted graph of directed/undirected\n"
    "    edges from stdin (or from the optionally-specified file).\n"
    "    k value top K value.\n"
    "  --device=<device_index>  Set GPU device for running the graph primitive.\n"
    "  --instrumented If set then kernels keep track of queue-search_depth\n"
    "  and barrier duty (a relative indicator of load imbalance.)\n"
    "  --quick If set will skip the CPU validation code.\n");
}

/**
 * @brief displays the top K results
 *
 */
template<
  typename VertexId,
  typename Value,
  typename SizeT>
void DisplaySolution(
  VertexId *h_node_id,
  Value    *h_degrees,
  SizeT    num_nodes)
{
  // at most display first 100 results
  if (num_nodes > 100)
  {
    num_nodes = 100;
  }
  printf("==> top %d centrality nodes:\n", num_nodes);
  for (SizeT i = 0; i < num_nodes; ++i)
  {
    printf("%d %d\n", h_node_id[i], h_degrees[i]);
  }
  printf("\n");

  fflush(stdout);
}

/******************************************************************************
