class_docstr: Disjoint set data structure for incremental connectivity queries.
  
  .. versionadded:: 1.6.0
  
  Attributes
  ----------
  n_subsets : int
      The number of subsets.
  
  Methods
  -------
  add
  merge
  connected
  subset
  subset_size
  subsets
  __getitem__
  
  Notes
  -----
  This class implements the disjoint set [1]_, also known as the *union-find*
  or *merge-find* data structure. The *find* operation (implemented in
  `__getitem__`) implements the *path halving* variant. The *merge* method
  implements the *merge by size* variant.
  
  References
  ----------
  .. [1] https://en.wikipedia.org/wiki/Disjoint-set_data_structure
  
  Examples
  --------
  >>> from scipy.cluster.hierarchy import DisjointSet
  
  Initialize a disjoint set:
  
  >>> disjoint_set = DisjointSet([1, 2, 3, 'a', 'b'])
  
  Merge some subsets:
  
  >>> disjoint_set.merge(1, 2)
  True
  >>> disjoint_set.merge(3, 'a')
  True
  >>> disjoint_set.merge('a', 'b')
  True
  >>> disjoint_set.merge('b', 'b')
  False
  
  Find root elements:
  
  >>> disjoint_set[2]
  1
  >>> disjoint_set['b']
  3
  
  Test connectivity:
  
  >>> disjoint_set.connected(1, 2)
  True
  >>> disjoint_set.connected(1, 'b')
  False
  
  List elements in disjoint set:
  
  >>> list(disjoint_set)
  [1, 2, 3, 'a', 'b']
  
  Get the subset containing 'a':
  
  >>> disjoint_set.subset('a')
  {'a', 3, 'b'}
  
  Get the size of the subset containing 'a' (without actually instantiating
  the subset):
  
  >>> disjoint_set.subset_size('a')
  3
  
  Get all subsets in the disjoint set:
  
  >>> disjoint_set.subsets()
  [{1, 2}, {'a', 3, 'b'}]
docstr: Get the size of the subset containing `x`.
  
  Note that this method is faster than ``len(self.subset(x))`` because
  the size is directly read off an internal field, without the need to
  instantiate the full subset.
  
  Parameters
  ----------
  x : hashable object
      Input element.
  
  Returns
  -------
  result : int
      Size of the subset containing `x`.
code: def subset_size(self, x):
      """Get the size of the subset containing `x`.
  
      Note that this method is faster than ``len(self.subset(x))`` because
      the size is directly read off an internal field, without the need to
      instantiate the full subset.
  
      Parameters
      ----------
      x : hashable object
          Input element.
  
      Returns
      -------
      result : int
          Size of the subset containing `x`.
      """
      return self._sizes[self[x]]
  
file_path: scipy/scipy/_lib/_disjoint_set.py
label_desc: Use image node_id 10 for calling the DisjointSet obj's underlying member method code with example usage: obj.subset_size(x) and returns: self