Package org.neo4j.graphalgo.impl.centrality

Centrality graph algorithms which are allright to use, but doesn't scale to bigger graphs.

See:
Description

Interface Summary

CostDivider<CostType>	To make calculations as general as possible, this follows a similar idea to CostAccumulator.
EigenvectorCentrality	Interface representing the algorithms for computing eigenvector centrality.

Class Summary

BetweennessCentrality<ShortestPathCostType>	Class for computing betweenness centrality as defined by Linton C.
ClosenessCentrality<ShortestPathCostType>	Implementation of closeness centrality, which can be seen as the "average" distance from every node to all other nodes.
Eccentricity<ShortestPathCostType>	This can be used to calculate the eccentricity of nodes, which is defined as the maximum distance to any other node.
EigenvectorCentralityArnoldi	Computing eigenvector centrality with the "Arnoldi iteration".
EigenvectorCentralityPower	Computing eigenvector centrality with the "power method".
NetworkDiameter<ShortestPathCostType>	This can be used to calculate the diameter of a network, which is defined as the largest eccentricity of all the nodes in the network.
NetworkRadius<ShortestPathCostType>	This can be used to calculate the radius of a network, which is defined as the smallest eccentricity of all the nodes in the network.
ParallellCentralityCalculation<ShortestPathCostType>	This is a utility class used to group together a number of centrality measure calculations to run them all at the same time.
ShortestPathBasedCentrality<CentralityType,ShortestPathCostType>	This serves as a base class for all centrality algorithms based on shortest paths.
StressCentrality<ShortestPathCostType>	Implementation of stress centrality, which is defined as the number of shortest paths going through each node.

Package org.neo4j.graphalgo.impl.centrality Description

Centrality graph algorithms which are allright to use, but doesn't scale to bigger graphs.