centrality.h File Reference

#include <mutex>
#include "graph/undirected_graph.h"
#include "graph/directed_graph.h"
#include <vector>
#include "graph/algorithms/centrality.tcc"

Go to the source code of this file.

Namespaces
	meta
	The ModErn Text Analysis toolkit is a suite of natural language processing, classification, information retreival, data mining, and other applications of text processing.
	meta::graph
	Contains implementations of the graph data structure and algorithms that operate over them.
	meta::graph::algorithms::internal
	Contains helper functions used by the centrality measures.

Typedefs
using	meta::graph::algorithms::centrality_result = std::vector< std::pair< node_id, double >>

Functions
template<class Graph >
centrality_result	meta::graph::algorithms::degree_centrality (const Graph &g)
	Find the degree centrality of each node in the graph, which is simply the number of adjacent links. More...
template<class Graph >
centrality_result	meta::graph::algorithms::betweenness_centrality (const Graph &g)
	Find the betweenness centrality of each node in the graph using the algorithm from Ulrik Brandes, 2001. More...
template<class Graph >
centrality_result	meta::graph::algorithms::eigenvector_centrality (const Graph &g, uint64_t max_iters=100)
	Finds the eigenvector centrality of each node (i.e. More...
template<class Graph >
void	meta::graph::algorithms::internal::betweenness_step (const Graph &g, centrality_result &cb, node_id n, std::mutex &calc_mut)
	Helper function for betweenness_centrality.

Detailed Description

Author

Sean Massung

All files in META are dual-licensed under the MIT and NCSA licenses. For more details, consult the file LICENSE.mit and LICENSE.ncsa in the root of the project.