inter_community_non_edges(G, partition)

Parameters

G : NetworkX graph.

partition : iterable of sets of nodes

This must be a partition of the nodes of G.

A *non-edge* is a pair of nodes (undirected if `G` is undirected) :

that are not adjacent in `G`. The *inter-community non-edges* are :

those non-edges on a pair of nodes in different blocks of the :

partition. :

Implementation note: this function creates two intermediate graphs, :

which may require up to twice the amount of memory as required to :

store `G`. :

Returns the number of inter-community non-edges according to the given partition of the nodes of G.

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/quality.py#110
type: <class 'function'>
Commit: