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 nodes connecting to the given node (or list of nodes).
docstr_tok: ["Returns","nodes","connecting","to","the","given","node","(","or","list","of","nodes",")","."]
code: def incoming(self, node):
      """Returns nodes connecting to the given node (or list of nodes)."""
      nodes = node if isinstance(node, list) else [node]
      node_ids = [self.id(n) for n in nodes]
      # Find edges incoming to this group but not outgoing from it
      incoming = [
          self[e[0]]
          for e in self.edges
          if e[1] in node_ids and e[0] not in node_ids
      ]
      return incoming
  
imports: from __future__ import absolute_import, division, print_function
  import os
  import re
  from random import getrandbits
  import inspect
  import numpy
label_desc: Use image node_id 7 for calling the Graph obj's underlying member method code with example usage: obj.incoming(node) and returns: incoming