Constant Field Values

Contents

org.neo4j.*

  • org.neo4j.gds.centrality.HarmonicCentralityProc<PROC_RESULT> 
    Modifier and Type Constant Field Value
    protected static final java.lang.String DESCRIPTION "Harmonic centrality is a way of detecting nodes that are able to spread information very efficiently through a graph."
  • org.neo4j.gds.influenceMaximization.CELFProc 
    Modifier and Type Constant Field Value
    public static final java.lang.String DESCRIPTION "The Cost Effective Lazy Forward (CELF) algorithm aims to find k nodes that maximize the expected spread of influence in the network."
  • org.neo4j.gds.influenceMaximization.GreedyProc 
    Modifier and Type Constant Field Value
    public static final java.lang.String DESCRIPTION "The Greedy algorithm aims to find k nodes that maximize the expected spread of influence in the network."
  • org.neo4j.gds.ml.linkmodels.pipeline.LinkPredictionPipelineCompanion 
    Modifier and Type Constant Field Value
    public static final java.lang.String ESTIMATE_PREDICT_DESCRIPTION "Estimates memory for predicting links based on a previously trained pipeline model"
    public static final java.lang.String PREDICT_DESCRIPTION "Predicts relationships for all node pairs based on a previously trained link prediction model."
  • org.neo4j.gds.ml.nodemodels.pipeline.NodeClassificationPipelineCompanion 
    Modifier and Type Constant Field Value
    public static final java.lang.String ESTIMATE_PREDICT_DESCRIPTION "Estimates memory for predicting classes for all nodes based on a previously trained pipeline model"
    public static final java.lang.String PREDICT_DESCRIPTION "Predicts classes for all nodes based on a previously trained pipeline model"
  • org.neo4j.gds.scc.SccProc<PROC_RESULT> 
    Modifier and Type Constant Field Value
    protected static final java.lang.String DESCRIPTION "The SCC algorithm finds sets of connected nodes in an directed graph, where all nodes in the same set form a connected component."
  • org.neo4j.gds.shortestpaths.AllShortestPathsProc 
    Modifier and Type Constant Field Value
    public static final java.lang.String DESCRIPTION "The All Pairs Shortest Path (APSP) calculates the shortest (weighted) path between all pairs of nodes."
  • org.neo4j.gds.spanningtree.KSpanningTreeMaxProc 
    Modifier and Type Constant Field Value
    public static final java.lang.String DESCRIPTION "The maximum weight spanning tree (MST) starts from a given node, and finds all its reachable nodes and the set of relationships that connect the nodes together with the maximum possible weight."
  • org.neo4j.gds.spanningtree.KSpanningTreeMinProc 
    Modifier and Type Constant Field Value
    public static final java.lang.String DESCRIPTION "The minimum weight spanning tree (MST) starts from a given node, and finds all its reachable nodes and the set of relationships that connect the nodes together with the minimum possible weight."
  • org.neo4j.gds.spanningtree.KSpanningTreeProc 
    Modifier and Type Constant Field Value
    public static final java.lang.String DEFAULT_CLUSTER_PROPERTY "partition"
  • org.neo4j.gds.spanningtree.SpanningTreeConfig 
    Modifier and Type Constant Field Value
    public static final java.lang.String WRITE_RELATIONSHIP_TYPE "MST"