causal_networkx.algorithms.find_cliques#

causal_networkx.algorithms.find_cliques(G, nodes=None)[source]#

Find all maximal cliques in causal DAG.

This operates over the directed edges of the causal graph, excluding the bidirected edges.

Parameters:

G : ADMG

The causal diagram.

nodes : list, optional

The list of nodes to consider, by default None

Returns:

iterator

The cliques in a causal DAG.

:rtype:py:class:Iterator