code: def _get_connected_components_adjacency(self, graph, counts):
          ''' find the connected UMIs within an adjacency dictionary'''
  
          found = set()
          components = list()
  
          for node in sorted(graph, key=lambda x: counts[x], reverse=True):
              if node not in found:
                  # component = self.search(node, graph)
                  component = breadth_first_search(node, graph)
                  found.update(component)
                  components.append(component)
          return componentf _get_connected_components_adjacency(self, graph, counts):
          ''' find the connected UMIs within an adjacency dictionary'''
  
          found = set()
          components = list()
  
          for node in sorted(graph, key=lambda x: counts[x], reverse=True):
              if node not in found:
                  # component = self.search(node, graph)
                  component = breadth_first_search(node, graph)
                  found.update(component)
                  components.append(component)
          return components
docs: find the connected UMIs within an adjacency dictionary