chordal_graph_treewidth(G)
A NetworkX graph
The algorithm does not support DiGraph, MultiGraph and MultiDiGraph. The algorithm can only be applied to chordal graphs. If the input graph is found to be non-chordal, a NetworkXError
is raised.
The size of the largest clique in the graph minus one.
Returns the treewidth of the chordal graph G.
>>> e = [See :
... (1, 2),
... (1, 3),
... (2, 3),
... (2, 4),
... (3, 4),
... (3, 5),
... (3, 6),
... (4, 5),
... (4, 6),
... (5, 6),
... (7, 8),
... ]
... G = nx.Graph(e)
... G.add_node(9)
... nx.chordal_graph_treewidth(G) 3
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.chordal.chordal_graph_treewidth
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