(self)
return interPathTimes
Returns a dictionary which, for each node v, contains all time differences 
        between any time-stamped link (*,v;t) and the next link (v,*;t') (t'>t)
        in the temporal network
Returns a dictionary which, for each node v, contains all time differences 
        between any time-stamped link (*,v;t) and the next link (v,*;t') (t'>t)
        in the temporal network
Returns a dictionary which for each node v contains all time differences between any time - stamped link ( * v ; t ) and the next link ( v * ; t ) ( t > t ) in the temporal network
def getInterPathTimes(self):
        """
        Returns a dictionary which, for each node v, contains all time differences 
        between any time-stamped link (*,v;t) and the next link (v,*;t') (t'>t)
        in the temporal network
        """

        interPathTimes = _co.defaultdict( lambda: list() )
        for e in self.tedges:
            # Get target v of current edge e=(u,v,t)
            v = e[1]
            t = e[2]

            # Get time stamp of link (v,*,t_next) with smallest t_next such that t_next > t
            i = _bs.bisect_right(self.activities[v], t)
            if i != len(self.activities[v]):
                interPathTimes[v].append(self.activities[v][i]-t)
        return interPathTimes
def getInterPathTimes ( self ) : interPathTimes = _co . defaultdict ( lambda : list ( ) ) for e in self . tedges : # Get target v of current edge e=(u,v,t) v = e [ 1 ] t = e [ 2 ] # Get time stamp of link (v,*,t_next) with smallest t_next such that t_next > t i = _bs . bisect_right ( self . activities [ v ] , t ) if i != len ( self . activities [ v ] ) : interPathTimes [ v ] . append ( self . activities [ v ] [ i ] - t ) return interPathTimes