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
ClosenessCentralityProc
CollapsePathMutateProc
CollapsePathMutateProc.MutateResult
CosineProc
DegreeCentralityConfig
DegreeCentralityProc
EigenvectorCentralityProc
EuclideanProc
HarmonicCentralityProc
HarmonicCentralityProc.StreamResult
Hits
Hits.HitsConfig
InputNodeValidator
IsFiniteFunc
KSpanningTreeConfig
KSpanningTreeProc
LinkPredictionFunc
LinkPredictionPredictMutateProc
LinkPredictionPredictMutateProc.MutateResult
LinkPredictionTrainProc
MLTrainResult
NeighborsFinder
NodeClassificationPredictMutateProc
NodeClassificationPredictMutateProc.MutateResult
NodeClassificationTrainProc
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
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.
SimilaritiesFunc
SpanningTreeBaseConfig
SpanningTreeConfig
SpanningTreeProc
SpeakerListenerLPA
SpeakerListenerLPA.SpeakerListenerLPAConfig
SplitRelationshipsMutateProc
SplitRelationshipsMutateProc.MutateResult
TraverseProc
TriangleProc