Triangle counting using liblemon
counting.h
Go to the documentation of this file.
1 // Copyright 2019 zhaofeng-shu33
2 #pragma once
3 #include <vector>
7 
8 #include "lemontc/config.h"
9 
10 namespace lemon {
13  int64_t triangle_count(const Graph& G, int total_edge);
15  int collect_degree_info(const Graph& G,
16  std::vector<int>* degree_list, int node_size);
19  int64_t triangle_count_vertex_iteration(const Graph& G,
20  const std::vector<int>& degree_list, int max_degree);
21 } // namespace lemon
configuration lemon triangle counter configuration header
lemon original namespace
int collect_degree_info(const Graph &G, std::vector< int > *degree_list, int node_size)
compute the degree for each node and save them to degree_list
Definition: counting.cpp:156
int64_t triangle_count_vertex_iteration(const Graph &G, const std::vector< int > &degree_list, int max_degree)
Definition: counting.cpp:113
int64_t triangle_count(const Graph &G, int total_edge)
Definition: counting.cpp:39