     ref_degrees_n[node] = ref_degrees_n[node] + ref_degrees_r[node];
     results.push_back( std::make_pair (node, ref_degrees_n[node]) );
   }
-  
+
   // pair sort according to second elements - degree centrality
   std::stable_sort(results.begin(), results.end(), compare_second_only());
-  
+
   for (SizeT itr = 0; itr < top_nodes; ++itr)
   {
     ref_node_id[itr] = results[itr].first;

 *
 * @param[in] graph Reference to the CSR graph we process on
 */
struct compare_second_only 
{
  template <typename T1, typename T2>
  bool operator()(const std::pair<T1, T2>& p1, const std::pair<T1, T2>& p2)

using namespace gunrock::app::topk;

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