Uses of Interface
org.neo4j.graphalgo.impl.shortestpath.SingleSourceShortestPath

Packages that use SingleSourceShortestPath

org.neo4j.graphalgo.impl.centrality	Centrality graph algorithms which are allright to use, but doesn't scale to bigger graphs.
org.neo4j.graphalgo.impl.shortestpath	Package containing older implementations of Dijkstra and shortest path, where the ones in GraphAlgoFactory would be a better option.

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

Fields in org.neo4j.graphalgo.impl.centrality declared as SingleSourceShortestPath

protected SingleSourceShortestPath<ShortestPathCostType>	ShortestPathBasedCentrality.singleSourceShortestPath
protected SingleSourceShortestPath<ShortestPathCostType>	ParallellCentralityCalculation.singleSourceShortestPath

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

abstract void	ShortestPathBasedCentrality.processShortestPaths(Node node, SingleSourceShortestPath<ShortestPathCostType> singleSourceShortestPath) This is the abstract method all centrality algorithms based on this class need to implement.
void	BetweennessCentrality.processShortestPaths(Node node, SingleSourceShortestPath<ShortestPathCostType> singleSourceShortestPath)
void	Eccentricity.processShortestPaths(Node node, SingleSourceShortestPath<ShortestPathCostType> singleSourceShortestPath)
void	StressCentrality.processShortestPaths(Node node, SingleSourceShortestPath<ShortestPathCostType> singleSourceShortestPath)
void	ClosenessCentrality.processShortestPaths(Node node, SingleSourceShortestPath<ShortestPathCostType> singleSourceShortestPath)
void	NetworkDiameter.processShortestPaths(Node node, SingleSourceShortestPath<ShortestPathCostType> singleSourceShortestPath)
void	NetworkRadius.processShortestPaths(Node node, SingleSourceShortestPath<ShortestPathCostType> singleSourceShortestPath)

Constructors in org.neo4j.graphalgo.impl.centrality with parameters of type SingleSourceShortestPath

BetweennessCentrality(SingleSourceShortestPath<ShortestPathCostType> singleSourceShortestPath, Set<Node> nodeSet)
Default constructor.

ClosenessCentrality(SingleSourceShortestPath<ShortestPathCostType> singleSourceShortestPath, CostAccumulator<ShortestPathCostType> centralityAccumulator, ShortestPathCostType zeroValue, Set<Node> nodeSet, CostDivider<ShortestPathCostType> centralityDivider)
Default constructor.

Eccentricity(SingleSourceShortestPath<ShortestPathCostType> singleSourceShortestPath, ShortestPathCostType zeroValue, Set<Node> nodeSet, Comparator<ShortestPathCostType> distanceComparator)
Default constructor.

NetworkDiameter(SingleSourceShortestPath<ShortestPathCostType> singleSourceShortestPath, ShortestPathCostType zeroValue, Set<Node> nodeSet, Comparator<ShortestPathCostType> distanceComparator)
Default constructor.

NetworkRadius(SingleSourceShortestPath<ShortestPathCostType> singleSourceShortestPath, ShortestPathCostType zeroValue, Set<Node> nodeSet, Comparator<ShortestPathCostType> distanceComparator)
Default constructor.

ParallellCentralityCalculation(SingleSourceShortestPath<ShortestPathCostType> singleSourceShortestPath, Set<Node> nodeSet)
Default constructor.

ShortestPathBasedCentrality(SingleSourceShortestPath<ShortestPathCostType> singleSourceShortestPath, CostAccumulator<CentralityType> centralityAccumulator, CentralityType zeroValue, Set<Node> nodeSet)
Default constructor.

StressCentrality(SingleSourceShortestPath<ShortestPathCostType> singleSourceShortestPath, Set<Node> nodeSet)
Default constructor.

Uses of SingleSourceShortestPath in org.neo4j.graphalgo.impl.shortestpath

Classes in org.neo4j.graphalgo.impl.shortestpath that implement SingleSourceShortestPath

class	SingleSourceShortestPathBFS Breadth first search to find all shortest uniform paths from a node to all others.
class	SingleSourceShortestPathDijkstra<CostType> Dijkstra implementation to solve the single source shortest path problem for weighted networks.