Chordal

Algorithms for chordal graphs.

A graph is chordal if every cycle of length at least 4 has a chord (an edge joining two nodes not adjacent in the cycle). https://en.wikipedia.org/wiki/Chordal_graph

is_chordal(G)

Checks whether G is a chordal graph.

chordal_graph_cliques(G)

Returns the set of maximal cliques of a chordal graph.

chordal_graph_treewidth(G)

Returns the treewidth of the chordal graph G.

find_induced_nodes(G, s, t[, treewidth_bound])

Returns the set of induced nodes in the path from s to t.