ml.sparkling.graph.operators.measures.vertex

NeighborhoodConnectivity

object NeighborhoodConnectivity extends VertexMeasure[Double]

Created by Roman Bartusiak ([email protected] http://riomus.github.io).

Linear Supertypes
VertexMeasure[Double], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. NeighborhoodConnectivity
  2. VertexMeasure
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. def addTuples(t1: (Int, Int), t2: (Int, Int)): (Int, Int)

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  8. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. 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]

    Computes Neighborhood Connectivity of each vertex

    Computes Neighborhood Connectivity of each vertex

    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 neighbour connectivity

    Definition Classes
    NeighborhoodConnectivity → VertexMeasure
  10. def compute[VD, ED](graph: Graph[VD, ED])(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], num: Numeric[ED]): Graph[Double, ED]

    Definition Classes
    VertexMeasure
  11. def computeNeighborConnectivity[VD, ED](graph: Graph[VD, ED], vertexMeasureConfiguration: VertexMeasureConfiguration[VD, ED])(implicit arg0: ClassTag[VD], arg1: ClassTag[ED]): Graph[Double, ED]

    Generic Neighborhood Connectivity method, should be used for extensions

    Generic Neighborhood Connectivity method, should be used for extensions

    VD

    - vertex data type

    ED

    - edge data type

    graph

    - computation graph

    vertexMeasureConfiguration

    - configuration of computation

    returns

    graph where each vertex is associated with its neighbour connectivity

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

    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  14. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  16. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  17. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  18. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  19. final def notify(): Unit

    Definition Classes
    AnyRef
  20. final def notifyAll(): Unit

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

    Definition Classes
    AnyRef
  22. def toString(): String

    Definition Classes
    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 VertexMeasure[Double]

Inherited from AnyRef

Inherited from Any

Ungrouped