Ë
    …ÐVh   ã                   óŠ   — d Z ddl­ ddl­ ddl­ ddl­ ddl­ ddl­ ddl­ ddl­ ddl	­ ddl
­ ddl­ ddl­ ddl­ y)a3  Functions for computing and measuring community structure.

The ``community`` subpackage can be accessed by using :mod:`networkx.community`, then accessing the
functions as attributes of ``community``. For example::

    >>> import networkx as nx
    >>> G = nx.barbell_graph(5, 1)
    >>> communities_generator = nx.community.girvan_newman(G)
    >>> top_level_communities = next(communities_generator)
    >>> next_level_communities = next(communities_generator)
    >>> sorted(map(sorted, next_level_communities))
    [[0, 1, 2, 3, 4], [5], [6, 7, 8, 9, 10]]

é    )Ú*N)Ú__doc__Ú(networkx.algorithms.community.asyn_fluidÚ(networkx.algorithms.community.centralityÚ&networkx.algorithms.community.divisiveÚ%networkx.algorithms.community.kcliqueÚ+networkx.algorithms.community.kernighan_linÚ/networkx.algorithms.community.label_propagationÚ#networkx.algorithms.community.lukesÚ,networkx.algorithms.community.modularity_maxÚ%networkx.algorithms.community.qualityÚ-networkx.algorithms.community.community_utilsÚ%networkx.algorithms.community.louvainÚ$networkx.algorithms.community.leidenÚ#networkx.algorithms.community.local© ó    úV/home/dcms/DCMS/lib/python3.12/site-packages/networkx/algorithms/community/__init__.pyú<module>r      s3   ðñô 7Ü 6Ü 4Ü 3Ü 9Ü =Ü 1Ü :Ü 3Ü ;Ü 3Ü 2Ý 1r   