closeness

Introduction

Closeness of a vertex in a connected graph is a measure of the centrality. It calculated by summerizing the shortest distance from the vertex to others in the graph, and normalizing the reciprocal of it. The larger the closeness centrality of a vertex, it has more ties to the central part of the graph. The Wikipedia page is here. (https://en.wikipedia.org/wiki/Closeness_centrality )

Parameters

use --help param to view detailed help information.

Input Format

Input files should be formatted as follows:

<src>,<dst>

where <src> and <dst> are integers of type uint32_t, representing the end nodes of an edge. Note that Plato treats every input graph as undirected by default. For a directed graph, please ensure both <A, B> and <B, A> appear in the input file if they exist. Edges that appear more than once will be considered as multiple edges between the same pair of nodes.

Input example (Following numbers are synthetic and are for demonstration purpose only.)：

4564,823192
823192,973033
1713,823192

Output Format

Output files are formatted as follows：

<vertex_id>,<closeness_value>

where <vertex_id> represents a node and <closeness_value> gives the closeness value of node.

Output example (Following numbers are synthetic and are for demonstration purpose only.)：

4564,0.2552393450530435
823192,0.5215760529282608

Source code

https://github.com/Tencent/plato/tree/master/plato/algo/cnc