LabelPropagation

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. final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

10. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

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

    Definition Classes

    AnyRef → Any

12. def hashCode(): Int

    Definition Classes

    AnyRef → Any

13. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    AnyRef

15. final def notify(): Unit

    Definition Classes

    AnyRef

16. final def notifyAll(): Unit

    Definition Classes

    AnyRef

17. def run[VD, ED](graph: Graph[VD, ED], maxSteps: Int)(implicit arg0: ClassTag[ED]): Graph[VertexId, ED]

    Run static Label Propagation for detecting communities in networks.

    Run static Label Propagation for detecting communities in networks.

    Each node in the network is initially assigned to its own community. At every superstep, nodes send their community affiliation to all neighbors and update their state to the mode community affiliation of incoming messages.

    LPA is a standard community detection algorithm for graphs. It is very inexpensive computationally, although (1) convergence is not guaranteed and (2) one can end up with trivial solutions (all nodes are identified into a single community).

    ED

    the edge attribute type (not used in the computation)

    graph

    the graph for which to compute the community affiliation

    maxSteps

    the number of supersteps of LPA to be performed. Because this is a static implementation, the algorithm will run for exactly this many supersteps.

    returns

    a graph with vertex attributes containing the label of community affiliation

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

    Definition Classes

    AnyRef

19. def toString(): String

    Definition Classes

    AnyRef → Any

20. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )