Uses of Class
org.neo4j.graphalgo.impl.centrality.ShortestPathBasedCentrality

Packages that use ShortestPathBasedCentrality

org.neo4j.graphalgo.impl.centrality

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

Uses of ShortestPathBasedCentrality in org.neo4j.graphalgo.impl.centrality

Subclasses of ShortestPathBasedCentrality in org.neo4j.graphalgo.impl.centrality

class	BetweennessCentrality<ShortestPathCostType> Class for computing betweenness centrality as defined by Linton C.
class	ClosenessCentrality<ShortestPathCostType> Implementation of closeness centrality, which can be seen as the "average" distance from every node to all other nodes.
class	Eccentricity<ShortestPathCostType> This can be used to calculate the eccentricity of nodes, which is defined as the maximum distance to any other node.
class	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.
class	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.
class	StressCentrality<ShortestPathCostType> Implementation of stress centrality, which is defined as the number of shortest paths going through each node.

Methods in org.neo4j.graphalgo.impl.centrality with parameters of type ShortestPathBasedCentrality

void	ParallellCentralityCalculation.addCalculation(ShortestPathBasedCentrality<?,ShortestPathCostType> shortestPathBasedCentrality) This adds a centrality measure to be included in the calculation.