docstr: Edges one hop out from a node in the mapping should be
  time-respecting with respect to each other.
docstr_tok: ["Edges","one","hop","out","from","a","node","in","the","mapping","should","be","time-respecting","with","respect","to","each","other","."]
code: def one_hop(self, Gx, Gx_node, neighbors):
      """
      Edges one hop out from a node in the mapping should be
      time-respecting with respect to each other.
      """
      dates = []
      for n in neighbors:
          if isinstance(
              Gx, nx.Graph
          ):  # Graph G[u][v] returns the data dictionary.
              dates.append(Gx[Gx_node][n][self.temporal_attribute_name])
          else:  # MultiGraph G[u][v] returns a dictionary of key -> data dictionary.
              for edge in Gx[Gx_node][
                  n
              ].values():  # Iterates all edges between node pair.
                  dates.append(edge[self.temporal_attribute_name])
      if any(x is None for x in dates):
          raise ValueError(
              "Datetime not supplied for at least one edge."
          )
      return not dates or max(dates) - min(dates) <= self.delta
  
imports: import networkx
  from .isomorphvf2 import DiGraphMatcher, GraphMatcher
label_desc: Use image node_id 2 for calling the TimeRespectingGraphMatcher obj's underlying member method code with example usage: obj.one_hop(Gx, Gx_node, neighbors) and returns: unknown