INNER CODE UNIT · Python

LOWDIST

lzz19980125/awesome-time-series-segmentation-papers · DASSA-master/dassa.py:76

    LOWDIST=-99999999999999999
    dist = dict((x, LOWDIST) for x in graph.keys())
    dist[startnode] = 0

    ### MAIN PART
    comesfrom = dict()
    for node in order: # u
        for nbr, t1, t2, t3, nbrdist in graph[node]: # v
            if dist[nbr] < dist[node] + nbrdist :
                dist[nbr] = dist[node] + nbrdist
                comesfrom[nbr] = node

    ### BACKTRACKING FOR MAXPATH
    maxpath = [endnode]
    while maxpath[-1] != startnode:
        maxpath.append(comesfrom[maxpath[-1]])
    maxpath.reverse()
    Length = len(maxpath)

View source record →