def _merge(self, drifting_t, another_t):
    'Helper function to merge `drifting_t` with `another_t`\n\n        Assumes that both `drifting_t` and `another_t` exists.\n        Also assumes that `drifting_t` is an instance of `TFloating`\n        (otherwise, this might lead to weird graph configuration)\n\n        Parameters\n        ----------\n        drifting_t :\n            Existing drifting time in graph\n        another_t :\n            Existing time in graph\n        '
    for (t, _, key, data) in self.in_edges_iter(nbunch=[drifting_t], data=True, keys=True):
        if self.has_edge(t, another_t, key=key):
            key = None
        self.add_edge(t, another_t, key=key, attr_dict=data)
    for (_, t, key, data) in self.edges_iter(nbunch=[drifting_t], data=True, keys=True):
        if self.has_edge(another_t, t, key=key):
            key = None
        self.add_edge(another_t, t, key=key, attr_dict=data)
    self.remove_node(drifting_t)
Helper function to merge `drifting_t` with `another_t`

Assumes that both `drifting_t` and `another_t` exists.
Also assumes that `drifting_t` is an instance of `TFloating`
(otherwise, this might lead to weird graph configuration)

Parameters
----------
drifting_t :
    Existing drifting time in graph
another_t :
    Existing time in graph
def _merge(self, drifting_t, another_t):
    'Helper function to merge `drifting_t` with `another_t`\n\n        Assumes that both `drifting_t` and `another_t` exists.\n        Also assumes that `drifting_t` is an instance of `TFloating`\n        (otherwise, this might lead to weird graph configuration)\n\n        Parameters\n        ----------\n        drifting_t :\n            Existing drifting time in graph\n        another_t :\n            Existing time in graph\n        '
    for (t, _, key, data) in self.in_edges_iter(nbunch=[drifting_t], data=True, keys=True):
        if self.has_edge(t, another_t, key=key):
            key = None
        self.add_edge(t, another_t, key=key, attr_dict=data)
    for (_, t, key, data) in self.edges_iter(nbunch=[drifting_t], data=True, keys=True):
        if self.has_edge(another_t, t, key=key):
            key = None
        self.add_edge(another_t, t, key=key, attr_dict=data)
    self.remove_node(drifting_t)