_lg_undirected(G, selfloops=False, create_using=None)
Edges in G appear as nodes in L, represented as sorted tuples of the form (u,v), or (u,v,key) if G is a multigraph. A node in L corresponding to the edge {u,v} is connected to every node corresponding to an edge that involves u or v.
The standard algorithm for line graphs of undirected graphs does not produce self-loops.
An undirected graph or multigraph.
If :None:None:`True`, then self-loops are included in the line graph. If :None:None:`False`, they are excluded.
Graph type to create. If graph instance, then cleared before populated.
Returns the line graph L of the (multi)graph G.
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