convert_node_labels_to_integers(G, first_label=0, ordering='default', label_attribute=None)
Node and edge attribute data are copied to the new (relabeled) graph.
There is no guarantee that the relabeling of nodes to integers will give the same two integers for two (even identical graphs). Use the :None:None:`ordering` argument to try to preserve the order.
A NetworkX graph
An integer specifying the starting offset in numbering nodes. The new integer labels are numbered first_label, ..., n-1+first_label.
Name of node attribute to store old label. If None no attribute is created.
Returns a copy of the graph G with the nodes relabeled using consecutive integers.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.relabel.relabel_nodes
networkx.algorithms.community.kclique.k_clique_communities
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