class_docstr: The disjoint set is represented with an list <n> of integers where
  <n[i]> is the parent of the node at position <i>.
  If <n[i]> = <i>, <i> it's a root, or a head, of a set
docstr: Args:
      n (int): Number of vertices in the graph
docstr_tok: ["Args",":","n","(","int",")",":","Number","of","vertices","in","the","graph"]
code: def __init__(self, size):
      """
      Args:
          n (int): Number of vertices in the graph
      """
  
      self.parent = [
          None
      ] * size  # Contains wich node is the parent of the node at poisition <i>
      self.size = [
          1
      ] * size  # Contains size of node at index <i>, used to optimize merge
      for i in range(size):
          self.parent[i] = i
  
file_path: keon-algos/algorithms/graph/minimum_spanning_tree.py
imports: import sys
label_desc: Use image node_id 1 to create a new DisjointSet object  with example: obj = DisjointSet(size)