All Classes

Class	Description
ActivationFunction
Aggregator
Aggregator
Aggregator.AggregatorType
AllShortestPathsBaseConfig
AllShortestPathsDeltaBaseConfig
AllShortestPathsDeltaMutateConfig
AllShortestPathsDeltaStatsConfig
AllShortestPathsDeltaStreamConfig
AllShortestPathsDeltaWriteConfig
AllShortestPathsDijkstraMutateConfig
AllShortestPathsDijkstraStreamConfig
AllShortestPathsDijkstraWriteConfig
ANPStrategy	"Aggregated Neighbor Processing" (ANP) strategy as described in The More the Merrier: Efficient Multi-Source Graph Traversal http://www.vldb.org/pvldb/vol8/p449-then.pdf
ArticleRankComputation
AStar
AStar.HaversineHeuristic
AStarFactory<CONFIG extends ShortestPathAStarBaseConfig>
BatchSampler
BetweennessCentrality
BetweennessCentralityBaseConfig
BetweennessCentralityFactory<CONFIG extends BetweennessCentralityBaseConfig>
BetweennessCentralityMutateConfig
BetweennessCentralityStatsConfig
BetweennessCentralityStreamConfig
BetweennessCentralityWriteConfig
BFS	Parallel implementation of the BFS algorithm.
BfsAlgorithmFactory<CONFIG extends BfsBaseConfig>
BfsBaseConfig
BfsConsumer
BfsMutateConfig
BfsSources
BfsStatsConfig
BfsStreamConfig
BfsWithPredecessorConsumer
BinarizeFeaturesConfig
CELF
CELFAlgorithmFactory<CONFIG extends InfluenceMaximizationBaseConfig>
ClosenessCentrality	Normalized Closeness Centrality Utilizes the MSBFS for counting the farness between nodes.
ClosenessCentralityConfig
ClosenessCentralityFactory<CONFIG extends ClosenessCentralityConfig>
ClosenessCentralityMutateConfig
ClosenessCentralityResult
ClosenessCentralityStatsConfig
ClosenessCentralityStreamConfig
ClosenessCentralityWriteConfig
CollapsePath	A path template is a list of relationship types.
CollapsePathAlgorithmFactory
CollapsePathConfig
CollapsePathTaskSupplier
ColoringStep
CommunityData
CommunityModularity
CompressedRandomWalks
CompressedRandomWalks.CompressedWalkIterator
Cosine	We compute cosine similarity (normalised dot product) and turn it into a similarity metric by moving and clamping -1..1 into 0..1 using linear transformation.
DefaultCentralityComputer
DegreeCentrality
DegreeCentrality.DegreeFunction
DegreeCentralityConfig
DegreeCentralityFactory<CONFIG extends DegreeCentralityConfig>
DegreeCentralityMutateConfig
DegreeCentralityStatsConfig
DegreeCentralityStreamConfig
DegreeCentralityWriteConfig
DeltaStepping
DeltaSteppingFactory<T extends AllShortestPathsDeltaBaseConfig>
DFS
DfsAlgorithmFactory<CONFIG extends DfsBaseConfig>
DfsBaseConfig
DfsMutateConfig
DfsStreamConfig
Dijkstra
Dijkstra.HeuristicFunction
Dijkstra.RelationshipFilter
Dijkstra.TraversalPredicate
DijkstraFactory<T extends org.neo4j.gds.config.AlgoBaseConfig & org.neo4j.gds.config.RelationshipWeightConfig>
DijkstraFactory.AllShortestPathsDijkstraFactory<T extends AllShortestPathsBaseConfig>
DijkstraFactory.SourceTargetDijkstraFactory<T extends ShortestPathBaseConfig>
DijkstraResult
Direction
EigenvectorComputation
Euclidean	Here we calculate Euclidean similarity metrics using Euclidean dictance as described in e.g.
ExecutionStrategy
ExitPredicate
ExitPredicate.Result
FastRP
FastRP.FastRPResult
FastRPBaseConfig
FastRPFactory<CONFIG extends FastRPBaseConfig>
FastRPMutateConfig
FastRPStatsConfig
FastRPStreamConfig
FastRPWriteConfig
FeatureFunction
FilteredKnn	Filtered KNN is the same as ordinary KNN, _but_ we allow users to regulate final output in two ways.
FilteredKnnBaseConfig
FilteredKnnFactory<CONFIG extends FilteredKnnBaseConfig>
FilteredKnnMutateConfig
FilteredKnnResult
FilteredKnnStatsConfig
FilteredKnnStreamConfig
FilteredKnnWriteConfig
FilteredNodeSimilarityBaseConfig
FilteredNodeSimilarityFactory<CONFIG extends FilteredNodeSimilarityBaseConfig>
FilteredNodeSimilarityMutateConfig
FilteredNodeSimilarityStatsConfig
FilteredNodeSimilarityStreamConfig
FilteredNodeSimilarityWriteConfig
ForwardTraverser
ForwardTraverser.Factory
FullSelectionStrategy
GenerateFeaturesConfig
GraphIntersect<CURSOR extends org.neo4j.gds.api.AdjacencyCursor>	An instance of this is not thread-safe; Iteration/Intersection on multiple threads will throw misleading NullPointerExceptions.
GraphSage
GraphSage.GraphSageResult
GraphSageAlgorithmFactory<CONFIG extends GraphSageBaseConfig>
GraphSageBaseConfig
GraphSageEmbeddingsGenerator
GraphSageHelper
GraphSageLoss
GraphSageModel
GraphSageModelResolver
GraphSageModelTrainer
GraphSageModelTrainer.GraphSageTrainMetrics
GraphSageModelTrainer.ModelTrainResult
GraphSageMutateConfig
GraphSageStreamConfig
GraphSageTrain
GraphSageTrainAlgorithmFactory
GraphSageTrainConfig
GraphSageWriteConfig
HashGNN	Based on the paper "Hashing-Accelerated Graph Neural Networks for Link Prediction"
HashGNN.HashGNNResult
HashGNNCompanion
HashGNNFactory<CONFIG extends org.neo4j.gds.embeddings.hashgnn.HashGNNConfig>
HashGNNMutateConfig
HashGNNStreamConfig
HugeGraphIntersect
HugeGraphIntersect.HugeGraphIntersectFactory
InfluenceMaximizationBaseConfig
InfluenceMaximizationMutateConfig
InfluenceMaximizationResult
InfluenceMaximizationStatsConfig
InfluenceMaximizationStreamConfig
InfluenceMaximizationWriteConfig
IntersectingTriangleCount	TriangleCount counts the number of triangles in the Graph as well as the number of triangles that passes through a node.
IntersectingTriangleCount.TriangleCountResult
IntersectingTriangleCountFactory<CONFIG extends TriangleCountBaseConfig>
InverseRelationships
InverseRelationshipsAlgorithmFactory
InverseRelationshipsConfig
Jaccard
JaccardSimilarityComputer
K1Coloring	This is a parallel implementation of the K1-Coloring algorithm.
K1ColoringConfig
K1ColoringFactory<T extends K1ColoringConfig>
K1ColoringMutateConfig
K1ColoringStatsConfig
K1ColoringStreamConfig
K1ColoringWriteConfig
Kmeans
KmeansAlgorithmFactory<CONFIG extends KmeansBaseConfig>
KmeansBaseConfig
KmeansContext
KmeansIterationStopper
KmeansMutateConfig
KmeansPlusPlusSampler
KmeansResult
KmeansSampler
KmeansSampler.SamplerType
KmeansStatsConfig
KmeansStreamConfig
KmeansTask
KmeansUniformSampler
KmeansWriteConfig
Knn
Knn.Result
KnnBaseConfig
KnnContext
KnnFactory<CONFIG extends KnnBaseConfig>
KnnMutateConfig
KnnNeighborFilter
KnnNeighborFilterFactory
KnnNodePropertySpec
KnnNodePropertySpecParser
KnnSampler
KnnSampler.SamplerType
KnnStatsConfig
KnnStreamConfig
KnnWriteConfig
LabelNodeFilter
LabelNodeFilterSpec
LabelPropagation
LabelPropagationBaseConfig
LabelPropagationFactory<CONFIG extends LabelPropagationBaseConfig>
LabelPropagationMutateConfig
LabelPropagationStatsConfig
LabelPropagationStreamConfig
LabelPropagationWriteConfig
Layer
LayerConfig
LayerFactory
Leiden
LeidenAlgorithmFactory<CONFIG extends LeidenBaseConfig>
LeidenBaseConfig
LeidenDendrogramManager
LeidenMutateConfig
LeidenResult
LeidenStatsConfig
LeidenStreamConfig
LeidenWriteConfig
LocalClusteringCoefficient
LocalClusteringCoefficientBaseConfig
LocalClusteringCoefficientFactory<CONFIG extends LocalClusteringCoefficientBaseConfig>
LocalClusteringCoefficientMutateConfig
LocalClusteringCoefficientStatsConfig
LocalClusteringCoefficientStreamConfig
LocalClusteringCoefficientWriteConfig
LocalMoveTask
Louvain
LouvainBaseConfig
LouvainDendrogramManager
LouvainFactory<CONFIG extends LouvainBaseConfig>
LouvainMutateConfig
LouvainStatsConfig
LouvainStreamConfig
LouvainWriteConfig
MaxPoolAggregatingLayer
MaxPoolingAggregator
MeanAggregatingLayer
MeanAggregator
MemoryEstimateResult
MetricSimilarityComputer
MetricSimilarityComputer.MetricSimilarityComputerBuilder
ModelData
ModularityBaseConfig
ModularityCalculator
ModularityCalculatorFactory<CONFIG extends ModularityBaseConfig>
ModularityComputer
ModularityOptimization	Implementation of parallel modularity optimization based on: Lu, Hao, Mahantesh Halappanavar, and Ananth Kalyanaraman.
ModularityOptimizationConfig
ModularityOptimizationFactory<T extends ModularityOptimizationConfig>
ModularityOptimizationMutateConfig
ModularityOptimizationStreamConfig
ModularityOptimizationWriteConfig
ModularityResult
ModularityStatsConfig
ModularityStreamConfig
MSBFSConstants
MultiLabelFeatureExtractors
MultiLabelFeatureFunction
MultiLabelGraphSageTrain
MultiSourceBFSAccessMethods	Multi Source Breadth First Search implemented as described in [1].
MultiSourceBFSRunnable	Multi Source Breadth First Search implemented as described in [1].
NegativeSampleProducer
NeighborFilter
NeighborFilterFactory
NeighborList
NeighbourConsumer	During KNN execution, this listener is offered every neighbour we encounter.
NeighbourConsumers	A holder for NeighbourConsumers.
Node2Vec
Node2VecAlgorithmFactory<CONFIG extends Node2VecBaseConfig>
Node2VecBaseConfig
Node2VecBaseConfig.EmbeddingInitializer
Node2VecModel
Node2VecModel.Result
Node2VecMutateConfig
Node2VecStreamConfig
Node2VecWriteConfig
NodeFilter
NodeFilteredGraphIntersect	An instance of this is not thread-safe; Iteration/Intersection on multiple threads will throw misleading NullPointerExceptions.
NodeFilteredGraphIntersect.NodeFilteredGraphIntersectFactory
NodeFilterSpec	A NodeFilterSpec is a partially constructed NodeFilter.
NodeFilterSpecFactory
NodeIdNodeFilter
NodeIdNodeFilterSpec
NodeSimilarity
NodeSimilarityBaseConfig
NodeSimilarityFactory<CONFIG extends NodeSimilarityBaseConfig>
NodeSimilarityMetric
NodeSimilarityMutateConfig
NodeSimilarityResult
NodeSimilarityStatsConfig
NodeSimilarityStreamConfig
NodeSimilarityWriteConfig
NullCheckingNodePropertyValues
OneHopAggregator
Overlap
PageRankAlgorithm
PageRankAlgorithmFactory<CONFIG extends PageRankConfig>
PageRankAlgorithmFactory.Mode
PageRankComputation
PageRankConfig
PageRankMutateConfig
PageRankResult
PageRankStatsConfig
PageRankStreamConfig
PageRankWriteConfig
PathFactory
PathFactory.RelationshipIds
PathResult
Pearson	Here we compute Pearson correlation coefficient and turn that into a metric.
PositiveSampleProducer
PredecessorStrategy	Non-optimized execution MSBFS strategy as described in The More the Merrier: Efficient Multi-Source Graph Traversal http://www.vldb.org/pvldb/vol8/p449-then.pdf
Prim	Sequential Single-Source minimum weight spanning tree algorithm (PRIM).
RandomDegreeSelectionStrategy
RandomWalk
RandomWalkAlgorithmFactory<CONFIG extends RandomWalkBaseConfig>
RandomWalkBaseConfig
RandomWalkStatsConfig
RandomWalkStreamConfig
RefinementBetweenRelationshipCounter
RelationshipIntersectConfig
RelationshipIntersectFactory
RelationshipIntersectFactoryLocator
Rotation
SelectionStrategy
ShortestPathAStarBaseConfig
ShortestPathAStarMutateConfig
ShortestPathAStarStreamConfig
ShortestPathAStarWriteConfig
ShortestPathBaseConfig
ShortestPathDijkstraMutateConfig
ShortestPathDijkstraStreamConfig
ShortestPathDijkstraWriteConfig
ShortestPathsSteinerAlgorithm
ShortestPathYensBaseConfig
ShortestPathYensMutateConfig
ShortestPathYensStreamConfig
ShortestPathYensWriteConfig
SilhouetteTask
SimilaritiesFunc
SimilarityComputer
SimilarityFunction
SimilarityGraphBuilder
SimilarityGraphResult
SimilarityMetric
SimilarityResult
SingleLabelFeatureFunction
SingleLabelGraphSageTrain
SpanningGraph
SpanningTree	group of nodes that form a spanning tree
SpanningTreeAlgorithmFactory<CONFIG extends SpanningTreeBaseConfig>
SpanningTreeBaseConfig
SpanningTreeCompanion
SpanningTreeMutateConfig
SpanningTreeStatsConfig
SpanningTreeStreamConfig
SpanningTreeWriteConfig
SteinerBasedDeltaStepping
SteinerTreeAlgorithmFactory<CONFIG extends SteinerTreeBaseConfig>
SteinerTreeBaseConfig
SteinerTreeMutateConfig
SteinerTreeResult
SteinerTreeStatsConfig
SteinerTreeStreamConfig
SteinerTreeWriteConfig
TargetExitPredicate
TargetNodeFilter	This target node filter evaluates and stores incoming elements (neighbours) with their priority (score).
TargetNodeFiltering
TentativeDistances
TentativeDistances.DistanceAndPredecessor
TentativeDistances.DistanceOnly
TopKGraph
TopKMap
TopKMap.TopKList
TopNList
TopologicalSort
TopologicalSortConfig
TopologicalSortFactory<CONFIG extends TopologicalSortConfig>
TopologicalSortResult	An implementation of the result with message queues instead of synchronization.
ToUndirected
ToUndirectedAlgorithmFactory
ToUndirectedConfig
TrackRelationshipsConfig
TriangleCountBaseConfig
TriangleCountMutateConfig
TriangleCountStatsConfig
TriangleCountStreamConfig
TriangleCountWriteConfig
UnionGraphIntersect
UnionGraphIntersect.NodeFilteredUnionGraphIntersectFactory
UnionGraphIntersect.UnionGraphIntersectFactory
Wcc	Parallel Union-Find Algorithm based on the "Wait-free Parallel Algorithms for the Union-Find Problem" paper.
WccAlgorithmFactory<CONFIG extends WccBaseConfig>
WccBaseConfig
WccMutateConfig
WccStatsConfig
WccStreamConfig
WccWriteConfig
WritePathOptionsConfig
Yens
YensFactory<CONFIG extends ShortestPathYensBaseConfig>