eea41a4578b5021bbc16eb171bceb453cbde2419,pgmpy/base/UndirectedGraph.py,UndirectedGraph,check_clique,#UndirectedGraph#,115

Before Change

        False

        
        for i in range(len(nodes)):
            for j in range(i + 1, len(nodes)):
                if not self.has_edge(nodes[i], nodes[j]):
                    return False
        return True

After Change

        nodes: list of nodes.
            Nodes to check if they are a part of any clique.
        
        for node1, node2 in itertools.combinations(nodes, 2):
            if not self.has_edge(node1, node2):
                return False
        return True

    def is_triangulated(self):
        

Instances