This repository was archived by the owner on Apr 22, 2020. It is now read-only.
This repository was archived by the owner on Apr 22, 2020. It is now read-only.
Algorithm: Closeness Centrality #99
Description
Closeness Centrality of a node is a measure of centrality in a network, calculated as the sum of the length of the shortest paths between the node and all other nodes in the graph. Thus the more central a node is, the closer it is to all other nodes.
Progress
- adapt apoc-procedure to algorithm-api
- implement procedure
- tests
- edge case tests
- simple benchmark
- benchmark on bigger graphs
- parallelization
- evaluation