class_docstr: Tracks nodes and edges of a directed graph and supports basic operations on them.
class_docstr_tok: ["Tracks","nodes","and","edges","of","a","directed","graph","and","supports","basic","operations","on","them","."]
docstr: Returns all nodes that share the same parent (incoming node) with
  the given node, including the node itself.
docstr_tok: ["Returns","all","nodes","that","share","the","same","parent","(","incoming","node",")","with","the","given","node",",","including","the","node","itself","."]
code: def siblings(self, node):
      """Returns all nodes that share the same parent (incoming node) with
      the given node, including the node itself.
      """
      incoming = self.incoming(node)
      # TODO: Not handling the case of multiple incoming nodes yet
      if len(incoming) == 1:
          incoming = incoming[0]
          siblings = self.outgoing(incoming)
          return siblings
      else:
          return [node]
  
imports: from __future__ import absolute_import, division, print_function
  import os
  import re
  from random import getrandbits
  import inspect
  import numpy
  import html
label_desc: Use image node_id 8 for calling the Graph obj's underlying member method code with example usage: obj.siblings(node) and returns: siblings, list