com.twitter.cassovary.algorithms.centrality

AbstractCentrality

Related Doc: package centrality

abstract class AbstractCentrality extends Centrality

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.}

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

Instance Constructors

  1. new AbstractCentrality(graph: DirectedGraph[Node])

Abstract Value Members

  1. abstract def _recalc(): Unit

    Attributes
    protected

Concrete 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 andThen[A](g: (Double) ⇒ A): (Node) ⇒ A

    Definition Classes
    Function1
    Annotations
    @unspecialized()

  5. 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

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. val centralityValues: Array[Double]

    Attributes
    protected

  8. def clone(): AnyRef

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

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

    Definition Classes
    Function1
    Annotations
    @unspecialized()

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

    Definition Classes
    AnyRef

  11. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  12. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  14. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  15. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  17. final def notify(): Unit

    Definition Classes
    AnyRef

  18. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  19. 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

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

    Definition Classes
    AnyRef

  21. def toString(): String

    Definition Classes
    Function1 → AnyRef → Any

  22. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Centrality

Inherited from (Node) ⇒ Double

Inherited from AnyRef

Inherited from Any

Ungrouped