Object

ml.sparkling.graph.operators.measures.vertex.closenes

Closeness

Related Doc: package closenes

Permalink

object Closeness extends VertexMeasure[Double]

Created by Roman Bartusiak (roman.bartusiak@pwr.edu.pl http://riomus.github.io). Computes closeness centrality in standard and harmonic versions

Linear Supertypes
VertexMeasure[Double], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Closeness
  2. VertexMeasure
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

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

  6. def compute[VD, ED](graph: Graph[VD, ED], vertexMeasureConfiguration: VertexMeasureConfiguration[VD, ED])(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], num: Numeric[ED]): Graph[Double, ED]

    Permalink

    Computes standard closeness centrality

    Computes standard closeness centrality

    VD

    - vertex data type

    ED

    - edge data type

    graph

    - computation graph

    vertexMeasureConfiguration

    - configuration of computation

    num

    - numeric for @ED

    returns

    graph where each vertex is associated with its standard closeness centrality

    Definition Classes
    Closeness → VertexMeasure

  7. def compute[VD, ED](graph: Graph[VD, ED])(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], num: Numeric[ED]): Graph[Double, ED]

    Permalink
    Definition Classes
    VertexMeasure

  8. def computeHarmonic[VD, ED](graph: Graph[VD, ED], vertexMeasureConfiguration: VertexMeasureConfiguration[VD, ED])(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], num: Numeric[ED]): Graph[Double, ED]

    Permalink

    Computes harmonic closeness centrality

    Computes harmonic closeness centrality

    VD

    - vertex data type

    ED

    - edge data type

    graph

    - computation graph

    vertexMeasureConfiguration

    - configuration of computation

    num

    - numeric for @ED

    returns

    graph where each vertex is associated with its harmonic closeness centrality

  9. def computeUsing[VD, ED](graph: Graph[VD, ED], closenessFunction: ClosenessFunction, pathMappingFunction: PathMappingFunction, vertexMeasureConfiguration: VertexMeasureConfiguration[VD, ED], normalize: Boolean = false, checkpointingFrequency: Int = 20)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], num: Numeric[ED]): Graph[Double, ED]

    Permalink

    Generic closeness computation method, should be used for extensions.

    Generic closeness computation method, should be used for extensions. Computations are done using super-step approach

    VD

    - vertex data type

    ED

    - edge data type

    graph

    - computation graph

    closenessFunction

    - function that calculates closeness for vertex

    vertexMeasureConfiguration

    - configuration of computation

    num

    - numeric for @ED

    returns

    graph where each vertex is associated with its closeness centrality computed using @closenessFunction

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

    Permalink
    Definition Classes
    AnyRef

  11. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  12. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  14. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  16. val logger: Logger

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  19. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  21. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  22. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from VertexMeasure[Double]

Inherited from AnyRef

Inherited from Any

Ungrouped