All Classes

Class	Description
AllShortestPathsConfig
AllShortestPathsProc
AlphaAlgorithmFactory<ALGO extends org.neo4j.graphalgo.Algorithm<ALGO,?>,CONFIG extends org.neo4j.graphalgo.config.AlgoBaseConfig>
ApproxNearestNeighborsProc
ArticleRankConfig
ArticleRankProc
AsUndirected
CentralityUtils
CentralityUtils
ClosenessCentralityProc
CollapsePathMutateProc
CollapsePathMutateProc.MutateResult
CosineProc
DegreeCentralityConfig
DegreeCentralityProc
DijkstraProc
DijkstraProc.DijkstraResult
DijkstraProc.DijkstraResult.Builder
EigenvectorCentralityProc
EuclideanProc
HarmonicCentralityProc
HarmonicCentralityProc.StreamResult
InputNodeValidator
IsFiniteFunc
KShortestPathsProc	Yen's K shortest paths algorithm.
KShortestPathsProc.KspResult
KShortestPathsProc.KspResult.Builder
KShortestPathsProc.KspStreamResult
KSpanningTreeConfig
KSpanningTreeProc
LinkPredictionFunc
NeighborsFinder
NullGraph	The NullGraph is used for non-product algos that don't use a graph.
NullGraphStore	The NullGraphStore is used to store a NullGraph.
OneHotEncodingFunc
OverlapProc
PearsonProc
RandomWalkProc
SccProc
SccProc.SccResult
SccProc.SccResultBuilder
ShortestPathAStarConfig
ShortestPathAStarProc
ShortestPathDeltaSteppingConfig
ShortestPathDeltaSteppingProc	Delta-Stepping is a non-negative single source shortest paths (NSSSP) algorithm to calculate the length of the shortest paths from a starting node to all other nodes in the graph.
ShortestPathsConfig
ShortestPathsProc
SimilaritiesFunc
SpanningTreeBaseConfig
SpanningTreeConfig
SpanningTreeProc
TraverseProc
TriangleProc