dwave_networkx.algorithms.elimination_ordering.is_almost_simplicial

is_almost_simplicial(G, n)

Determines whether a node n in G is almost simplicial.

Parameters:

• G (graph) – A NetworkX graph.
• n (node) – A node in G.

Returns:

is_almost_simplicial – True if all but one of its neighbors induce a clique

Return type:

bool