cdlib.viz.plot_network_clusters¶
- cdlib.viz.plot_network_clusters(graph: object, partition: NodeClustering, position: dict | None = None, figsize: tuple = (8, 8), node_size: int | dict = 200, plot_overlaps: bool = False, plot_labels: bool = False, cmap: object | None = None, top_k: int | None = None, min_size: int | None = None, show_edge_widths: bool = False, show_edge_weights: bool = False, show_node_sizes: bool = False) object ¶
This function plots a graph where nodes are color-coded based on their community assignments. Each node belongs to a specific community, and this function visualizes these communities by assigning color to nodes in each community.
- Parameters:
graph – NetworkX/igraph graph
partition – NodeClustering object
position – A dictionary with nodes as keys and positions as values. Example: networkx.fruchterman_reingold_layout(G). By default, uses nx.spring_layout(g)
figsize – the figure size; it is a pair of float, default (8, 8)
node_size – The size of nodes. It can be an integer or a dictionary mapping nodes to sizes. Default is 200.
plot_overlaps – bool, default False. Flag to control if multiple algorithms memberships are plotted.
plot_labels – bool, default False. Flag to control if node labels are plotted.
cmap – str or Matplotlib colormap, Colormap(Matplotlib colormap) for mapping intensities of nodes. If set to None, original colormap is used.
top_k – int, Show the top K influential communities. If set to zero or negative value indicates all.
min_size – int, Exclude communities below the specified minimum size.
show_edge_widths – Flag to control if edge widths are shown. Default is False.
show_edge_weights – Flag to control if edge weights are shown. Default is False.
show_node_sizes – Flag to control if node sizes are shown. Default is False.
Example:
>>> from cdlib import algorithms, viz >>> import networkx as nx >>> g = nx.karate_club_graph() >>> coms = algorithms.louvain(g) >>> position = nx.spring_layout(g) >>> viz.plot_network_clusters(g, coms, position)