run_triangle_count.cpp File Reference

#include <havoqgt/page_rank.hpp>
#include <havoqgt/environment.hpp>
#include <havoqgt/cache_utilities.hpp>
#include <havoqgt/rmat_edge_generator.hpp>
#include <havoqgt/triangle_count.hpp>
#include <havoqgt/delegate_partitioned_graph.hpp>
#include <havoqgt/upper_triangle_edge_generator.hpp>
#include <havoqgt/gen_preferential_attachment_edge_list.hpp>
#include <boost/bind.hpp>
#include <boost/function.hpp>
#include <havoqgt/distributed_db.hpp>
#include <assert.h>
#include <deque>
#include <string>
#include <utility>
#include <algorithm>
#include <functional>
#include <boost/interprocess/managed_heap_memory.hpp>

Include dependency graph for run_triangle_count.cpp:

Go to the source code of this file.

Functions
int	main (int argc, char **argv)

Function Documentation

int main	(	int	argc,
		char **	argv
	)

Definition at line 78 of file run_triangle_count.cpp.

                                {
  typedef havoqgt::distributed_db::segment_manager_type segment_manager_t;
  typedef hmpi::delegate_partitioned_graph<segment_manager_t> graph_type;

  int mpi_rank(0), mpi_size(0);

  havoqgt::havoqgt_init(&argc, &argv);
  {
  CHK_MPI(MPI_Comm_rank(MPI_COMM_WORLD, &mpi_rank));
  CHK_MPI(MPI_Comm_size(MPI_COMM_WORLD, &mpi_size));
  havoqgt::get_environment();

  if (mpi_rank == 0) {
    std::cout << "MPI initialized with " << mpi_size << " ranks." << std::endl;
    std::cout << "CMD line:";
    for (int i = 0; i < argc; ++i) {
      std::cout << " " << argv[i];
    }
    std::cout << std::endl;
    havoqgt::get_environment().print();
    //print_system_info(false);
  }
  MPI_Barrier(MPI_COMM_WORLD);


  std::string graph_input;

  if (argc < 2) {
    std::cerr << "usage: <graph input file name>"
      << " (argc:" << argc << " )." << std::endl;
    exit(-1);
  } else {
    int pos = 1;
    graph_input = argv[pos++];
  }


  MPI_Barrier(MPI_COMM_WORLD);

  havoqgt::distributed_db ddb(havoqgt::db_open(), graph_input.c_str());

  graph_type *graph = ddb.get_segment_manager()->
    find<graph_type>("graph_obj").first;
  assert(graph != nullptr);

  MPI_Barrier(MPI_COMM_WORLD);
  if (mpi_rank == 0) {
    std::cout << "Graph Loaded Ready." << std::endl;
  }
  //graph->print_graph_statistics();
  MPI_Barrier(MPI_COMM_WORLD);
 
  for(int i=0; i<100; ++i) {
    uint64_t count = triangle_count(*graph, graph->label_to_locator(i));
    if(mpi_rank == 0) {
      std::cout << "Vertex " << i << " has " << count <<  " triangles." << std::endl;
    }
  }

  }  // END Main MPI
  havoqgt::havoqgt_finalize();

  return 0;
}

Here is the call graph for this function: