Object

ml.sparkling.graph.operators.measures.vertex

Degree

Related Doc: package vertex

Permalink

object Degree extends VertexMeasure[(Int, Int)]

Created by Roman Bartusiak (roman.bartusiak@pwr.edu.pl http://riomus.github.io). Computes degree of each vertex

Linear Supertypes
VertexMeasure[(Int, Int)], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Degree
  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[(Int, Int), ED]

    Permalink

    Computes degree of each vertex, returns degree in format (inDegree,outDegree)

    Computes degree of each vertex, returns degree in format (inDegree,outDegree)

    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 degree (out,in)

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

    Permalink
    Definition Classes
    VertexMeasure
  8. def computeInOut[VD, ED](graph: Graph[VD, ED], vertexMeasureConfiguration: VertexMeasureConfiguration[VD, ED])(implicit arg0: ClassTag[VD], arg1: ClassTag[ED]): Graph[(Int, Int), ED]

    Permalink

    Generic degree method, should be used for extensions, returns degree in format (inDegree,outDegree)

    Generic degree method, should be used for extensions, returns degree in format (inDegree,outDegree)

    VD

    - vertex data type

    ED

    - edge data type

    graph

    - computation graph

    vertexMeasureConfiguration

    - configuration of computation

    returns

    graph where each vertex is associated with its degree (out,in)

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  17. final def notifyAll(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  19. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  20. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. final def wait(arg0: Long): Unit

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

Inherited from VertexMeasure[(Int, Int)]

Inherited from AnyRef

Inherited from Any

Ungrouped