original_docstring: Adds an edge, and implicitly also creates nodes for keys which have
          not been seen before. This will not let you add data to your nodes.
          The relation encodes: "from_key depends on to_key"
          (to_key must be evaluated before from_key).
  
          Arguments
          ---------
          from_key : hashable
              The key which depends on.
          to_key : hashable
              The key which is depended on.
  
          Returns
          -------
          None
          
docstring: Adds an edge, and implicitly also creates nodes for keys which have
  not been seen before. This will not let you add data to your nodes.
  
  Arguments
  
  from_key : hashable
  The key which depends on.
  to_key : hashable
  The key which is depended on.
  
  Returns
  
  None
docstring_tokens: Adds an edge and implicitly also creates nodes for keys which have not been seen before . This will not let you add data to your nodes . Arguments from_key : hashable The key which depends on . to_key : hashable The key which is depended on . Returns None
code: def add_edge(self, from_key, to_key):
          """Adds an edge, and implicitly also creates nodes for keys which have
          not been seen before. This will not let you add data to your nodes.
          The relation encodes: "from_key depends on to_key"
          (to_key must be evaluated before from_key).
  
          Arguments
          ---------
          from_key : hashable
              The key which depends on.
          to_key : hashable
              The key which is depended on.
  
          Returns
          -------
          None
          """
          from_ind = self._get_ind_and_add_if_new(from_key)
          to_ind = self._get_ind_and_add_if_new(to_key)
          edges_list = self.digraph[from_ind].edges
          if to_ind not in edges_list:
              edges_list.append(to_ind)
code_tokens: def add_edge ( self , from_key , to_key ) : from_ind = self . _get_ind_and_add_if_new ( from_key ) to_ind = self . _get_ind_and_add_if_new ( to_key ) edges_list = self . digraph [ from_ind ] . edges if to_ind not in edges_list : edges_list . append ( to_ind )
short_docstring: Adds an edge, and implicitly also creates nodes for keys which have
  not been seen before.
short_docstring_tokens: Adds an edge and implicitly also creates nodes for keys which have not been seen before .
comment: """Adds an edge, and implicitly also creates nodes for keys which have
          not been seen before. This will not let you add data to your nodes.
          The relation encodes: "from_key depends on to_key"
          (to_key must be evaluated before from_key).
  
          Arguments
          ---------
          from_key : hashable
              The key which depends on.
          to_key : hashable
              The key which is depended on.
  
          Returns
          -------
          None
          """