class_docstr: Class for the Hitting Set Algorithm to obtain a approximate minimal set of backdoor variables
  to condition on for each node pair.
docstr: Modify count of number of sets each particular node belongs to based on nodes already covered in the previous iteration of the algorithm.
docstr_tok: ["Modify","count","of","number","of","sets","each","particular","node","belongs","to","based","on","nodes","already","covered","in","the","previous","iteration","of","the","algorithm","."]
code: def _modify_count(self, indices_covered):
      """
      Modify count of number of sets each particular node belongs to based on nodes already covered in the previous iteration of the algorithm.
      """
      for idx in indices_covered:
          for el in self._list_of_sets[idx]:
              if el not in self._colliders:
                  self._var_count[el] -= 1
  
imports: import networkx
  from dowhy.utils.graph_operations import adjacency_matrix_to_adjacency_list
label_desc: Use image node_id 5 for calling the HittingSetAlgorithm obj's underlying member method code with example usage: obj._modify_count(indices_covered) without return types