centrality.h

Go to the documentation of this file.

#ifndef META_GRAPH_ALGORITHMS_CENTRALITY_H_
#define META_GRAPH_ALGORITHMS_CENTRALITY_H_

#include <mutex>
#include "graph/undirected_graph.h"
#include "graph/directed_graph.h"

#include <vector>

namespace meta
{
namespace graph
{
namespace algorithms
{
using centrality_result = std::vector<std::pair<node_id, double>>;

template <class Graph>
centrality_result degree_centrality(const Graph& g);

template <class Graph>
centrality_result betweenness_centrality(const Graph& g);

template <class Graph>
centrality_result eigenvector_centrality(const Graph& g,
                                         uint64_t max_iters = 100);

namespace internal
{
template <class Graph>
void betweenness_step(const Graph& g, centrality_result& cb, node_id n,
                      std::mutex& calc_mut);
}
}
}
}

#include "graph/algorithms/centrality.tcc"
#endif