onion_layers(G)
The onion decomposition refines the k-core decomposition by providing information on the internal organization of each k-shell. It is usually used alongside the :None:None:`core numbers`.
Not implemented for graphs with parallel edges or self loops.
Not implemented for directed graphs.
A simple graph without self loops or parallel edges
The onion decomposition is not implemented for graphs with self loops or parallel edges or for directed graphs.
A dictionary keyed by vertex to the onion layer. The layers are contiguous integers starting at 1.
Returns the layer of each vertex in an onion decomposition of the 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