complete_to_chordal_graph(G)
Adds edges to a copy of G to create a chordal graph. A graph G=(V,E) is called chordal if for each cycle with length bigger than 3, there exist two non-adjacent nodes connected by an edge (called a chord).
There are different approaches to calculate the chordal enhancement of a graph. The algorithm used here is called MCS-M and gives at least minimal (local) triangulation of graph. Note that this triangulation is not necessarily a global minimum.
https://en.wikipedia.org/wiki/Chordal_graph
Undirected graph
The chordal enhancement of G
The elimination ordering of nodes of G
Return a copy of G completed to a chordal graph
>>> from networkx.algorithms.chordal import complete_to_chordal_graphSee :
... G = nx.wheel_graph(10)
... H, alpha = complete_to_chordal_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