From b6da5fabf77d9f7bcae4e3621ebfa8a4d99b8a18 Mon Sep 17 00:00:00 2001 From: Arnav Ahire Date: Sat, 22 Aug 2026 16:28:06 +0530 Subject: [PATCH] docs: fix spelling typos in community_edge_betweenness docstring --- src/igraph/community.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/igraph/community.py b/src/igraph/community.py index a3c6ce50b..13fe5465b 100644 --- a/src/igraph/community.py +++ b/src/igraph/community.py @@ -246,14 +246,14 @@ def _community_edge_betweenness(graph, clusters=None, directed=True, weights=Non practically defines the "level" where we "cut" the dendrogram to get the membership vector of the vertices. If C{None}, the dendrogram is cut at the level that maximizes the modularity when the graph is - unweighted; otherwise the dendrogram is cut at at a single cluster + unweighted; otherwise the dendrogram is cut at a single cluster (because cluster count selection based on modularities does not make sense for this method if not all the weights are equal). @param directed: whether the directionality of the edges should be taken into account or not. @param weights: name of an edge attribute or a list containing edge weights. Higher weights indicate stronger connections. - @return: a L{VertexDendrogram} object, initally cut at the maximum + @return: a L{VertexDendrogram} object, initially cut at the maximum modularity or at the desired number of clusters. """ merges, qs = GraphBase.community_edge_betweenness(graph, directed, weights)