docstr: Recursively build a set of some node's siblings in the graph
code: def collect_siblings(fx_graph, node_name, all_siblings):
      """Recursively build a set of some node's siblings in the graph"""
  
      # find all siblings of the requested node
      siblings = set()
      parents = fx_graph.get(node_name).get("real_parents")
      for parent in parents:
          children = fx_graph.get(parent).get("real_children")
          for child in children:
              siblings.add(child)
  
      # separate the new siblings, since we'll need to process them recursively
      new_siblings = siblings.difference(all_siblings)
      # update the final list with just the new elements
      all_siblings.update(new_siblings)
  
      for new_sibling in new_siblings:
          all_siblings = Permutation.collect_siblings(
              fx_graph, new_sibling, all_siblings
          )
  
      return all_siblings
  
imports: import os
  import torch
  import json
  import string
  import time
  import numpy
  import sys
  import builtins
  import io
label_desc: Use image node_id 27 for calling the Permutation obj's underlying member method code with example usage: obj.collect_siblings(fx_graph, node_name, all_siblings) and returns: all_siblings