_one_level(G, m, partition, resolution=1, is_directed=False, seed=None)

Parameters

G : NetworkX Graph/DiGraph

The graph from which to detect communities

m : number

The size of the graph G.

partition : list of sets of nodes

A valid partition of the graph G

resolution : positive number

The resolution parameter for computing the modularity of a partition

is_directed : bool

True if G is a directed graph.

seed : integer, random_state, or None (default)

Indicator of random number generation state. See Randomness<randomness> .

Calculate one level of the Louvain partitions tree

Examples

See :

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /networkx/algorithms/community/louvain.py#195
type: <class 'function'>
Commit: