Zog.Community.Walktrap (Zog v0.4.0)

View Source

Walktrap algorithm for community detection (Pons & Latapy 2006).

Uses random walks to compute distances between nodes and merges closest communities hierarchically based on Ward's criterion.

Summary

Functions

detect(graph)

Detects communities using Walktrap with default options.

detect_hierarchical(graph, walk_length \\ 4)

Full hierarchical Walktrap detection returning a Dendrogram.

detect_with_options(graph, opts \\ [])

Detects communities using Walktrap with custom options.

Functions

detect(graph)

@spec detect(Yog.Graph.t() | Zog.SoA.t()) :: Zog.Community.Result.t()

Detects communities using Walktrap with default options.

detect_hierarchical(graph, walk_length \\ 4)

@spec detect_hierarchical(Yog.Graph.t() | Zog.SoA.t(), integer()) ::
  Zog.Community.Dendrogram.t()

Full hierarchical Walktrap detection returning a Dendrogram.

detect_with_options(graph, opts \\ [])

@spec detect_with_options(Yog.Graph.t() | Zog.SoA.t(), keyword() | map()) ::
  Zog.Community.Result.t()

Detects communities using Walktrap with custom options.