networkx.algorithms.chordal.chordal_graph_cliques¶
-
chordal_graph_cliques
(G)[source]¶ Returns the set of maximal cliques of a chordal graph.
The algorithm breaks the graph in connected components and performs a maximum cardinality search in each component to get the cliques.
- Parameters
G (graph) – A NetworkX graph
- Returns
cliques
- Return type
A set containing the maximal cliques in G.
- Raises
NetworkXError – The algorithm does not support DiGraph, MultiGraph and MultiDiGraph. If the input graph is an instance of one of these classes, a
NetworkXError
is raised. The algorithm can only be applied to chordal graphs. If the input graph is found to be non-chordal, aNetworkXError
is raised.
Examples
>>> e = [ ... (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) >>> setlist = nx.chordal_graph_cliques(G)