centrality

Type Members

1. abstract class AbstractCentrality extends Centrality

   

   Centrality algorithm abstraction that requires a directed graph (graph) be passed upon instantiation.

   Centrality algorithm abstraction that requires a directed graph (graph) be passed upon instantiation. {@note The centrality values are stored in an internal array indexed by node's id. Hence, do not use for graphs with very large ids.}

2. trait Centrality extends (Node) ⇒ Double

   

   Starting point for all centrality algorithms.

3. class ClosenessCentrality extends AbstractCentrality

   

   Calculate the closeness centrality of graph

4. class DegreeCentrality extends AbstractCentrality

   

   Calculate the degree centrality for a specific graph and direction.

   Calculate the degree centrality for a specific graph and direction. If normalization is true then divide each node's degree centrality by the maximum number of possible connections within the graph.