dwave_networkx.algorithms.elimination_ordering.is_simplicial

is_simplicial(G, n)[source]

Determines whether a node n in G is simplicial.

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

is_simplicial – True if its neighbors form a clique.

Return type:

bool