Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions src/igraph/community.py
Original file line number Diff line number Diff line change
Expand Up @@ -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)
Expand Down