Constant Field Values
Contents
org.neo4j.*
-
org.neo4j.gds.centrality.HarmonicCentralityProc<PROC_RESULT> Modifier and Type Constant Field Value protected static final java.lang.StringDESCRIPTION"Harmonic centrality is a way of detecting nodes that are able to spread information very efficiently through a graph."
-
org.neo4j.gds.influenceMaximization.CELFStreamProc Modifier and Type Constant Field Value public static final java.lang.StringDESCRIPTION"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.StringDESCRIPTION"The Greedy algorithm aims to find k nodes that maximize the expected spread of influence in the network."
-
org.neo4j.gds.pregel.SpeakerListenerLPA Modifier and Type Constant Field Value public static final java.lang.StringLABELS_PROPERTY"communityIds"
-
org.neo4j.gds.scc.SccProc<PROC_RESULT> Modifier and Type Constant Field Value protected static final java.lang.StringDESCRIPTION"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.StringDESCRIPTION"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.StringDESCRIPTION"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.StringDESCRIPTION"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."