EigenvectorCentrality

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. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. 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 Eigenvector Centrality for each vertex in graph

   Computes Eigenvector Centrality for each vertex in graph

   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 eigenvector

   Definition Classes

   EigenvectorCentrality → VertexMeasure

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

   Definition Classes

   VertexMeasure

10. def computeEigenvector[VD, ED](graph: Graph[VD, ED], vertexMeasureConfiguration: VertexMeasureConfiguration[VD, ED], continuePredicate: (Long, Double, Double) ⇒ Boolean = convergencePredicate(1e-6))(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], num: Numeric[ED]): Graph[Double, ED]

    Generic Eigenvector Centrality computation method, should be used for extensions, computations are done until @continuePredicate gives true

    Generic Eigenvector Centrality computation method, should be used for extensions, computations are done until @continuePredicate gives true

    VD

    - vertex data type

    ED

    - edge data type

    graph

    - computation graph

    vertexMeasureConfiguration

    - configuration of computation

    continuePredicate

    - convergence predicate

    num

    - numeric for @ED

    returns

    graph where each vertex is associated with its eigenvector

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. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

21. def toString(): String

    Definition Classes

    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( ... )