Community Detection#
- raphtory.algorithms.weakly_connected_components(g, iter_count=9223372036854775807)#
Weakly connected community_detection – partitions the graph into node sets which are mutually reachable by an undirected path
This function assigns a component id to each vertex such that vertices with the same component id are mutually reachable by an undirected path.
- Parameters:
g (Raphtory graph) – Raphtory graph
iter_count (int) – Maximum number of iterations to run. Note that this will terminate early if the labels converge prior to the number of iterations being reached.
- Returns:
AlgorithmResult object with string keys and integer values mapping vertex names to their component ids.
- Return type: