blip.py
def done(self):
        """
        compute and store tree decomp and width based on
        elim_order(default: reverse topological order of the dag)
        """
        if self.elim_order is None:
            self.elim_order = list(nx.topological_sort(self.dag))[::-1]
        self._td = TreeDecomposition(self.get_moralized(), self.elim_order, self.tw)
        if self.tw <= 0:
            self.tw = self.td.width

        compute and store tree decomp and width based on
        elim_order(default: reverse topological order of the dag)
        
compute and store tree decomp and width based on
elim_order(default: reverse topological order of the dag)
compute and store tree decomp and width based on elim_order ( default : reverse topological order of the dag )
def done(self):
        if self.elim_order is None:
            self.elim_order = list(nx.topological_sort(self.dag))[::-1]
        self._td = TreeDecomposition(self.get_moralized(), self.elim_order, self.tw)
        if self.tw <= 0:
            self.tw = self.td.width
def done ( self ) : if self . elim_order is None : self . elim_order = list ( nx . topological_sort ( self . dag ) ) [ : : - 1 ] self . _td = TreeDecomposition ( self . get_moralized ( ) , self . elim_order , self . tw ) if self . tw <= 0 : self . tw = self . td . width
compute and store tree decomp and width based on
elim_order(default: reverse topological order of the dag)
compute and store tree decomp and width based on elim_order ( default : reverse topological order of the dag )
"""
        compute and store tree decomp and width based on
        elim_order(default: reverse topological order of the dag)
        """
self