com.twitter.cassovary.algorithms.centrality

DegreeCentrality

Related Doc: package centrality

class DegreeCentrality extends AbstractCentrality

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.

Linear Supertypes
AbstractCentrality, Centrality, (Node) ⇒ Double, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. DegreeCentrality
  2. AbstractCentrality
  3. Centrality
  4. Function1
  5. AnyRef
  6. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DegreeCentrality(graph: DirectedGraph[Node], dir: GraphDir, normalize: Boolean = true)

    graph

    The graph object on which calculate the degree centrality

    dir

    The direction of the edges to include in the degree centrality calculation.

    normalize

    Pass true to normalize the values by the maximum number of possible connections.

Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  4. def _recalc(): Unit

    Definition Classes
    DegreeCentrality → AbstractCentrality

  5. def andThen[A](g: (Double) ⇒ A): (Node) ⇒ A

    Definition Classes
    Function1
    Annotations
    @unspecialized()

  6. def apply(n: Node): Double

    Get the specified node's centrality value

    Get the specified node's centrality value

    n

    Node

    returns

    Centrality value for the n-th node

    Definition Classes
    AbstractCentrality → Function1

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  8. val centralityValues: Array[Double]

    Attributes
    protected
    Definition Classes
    AbstractCentrality

  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  10. def compose[A](g: (A) ⇒ Node): (A) ⇒ Double

    Definition Classes
    Function1
    Annotations
    @unspecialized()

  11. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  12. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  13. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  14. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  15. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  16. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  17. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  18. final def notify(): Unit

    Definition Classes
    AnyRef

  19. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  20. def recalculate(): IndexedSeq[Double]

    Run the centrality calculation and update centralityValues

    Run the centrality calculation and update centralityValues

    returns

    The centrality values of the graph

    Definition Classes
    AbstractCentrality

  21. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  22. def toString(): String

    Definition Classes
    Function1 → AnyRef → Any

  23. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  24. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  25. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AbstractCentrality

Inherited from Centrality

Inherited from (Node) ⇒ Double

Inherited from AnyRef

Inherited from Any

Ungrouped