INNER CODE UNIT · Python
longestpathDAG
lzz19980125/awesome-time-series-segmentation-papers · DASSA-master/dassa.py:66
def longestpathDAG(graph, startnode, endnode):
print('longsetpath...')
"""http://www.geeksforgeeks.org/find-longest-path-directed-acyclic-graph/"""
### TOPOLOGICALLY SORT THE VERTICES
order = []
for part in toposort(graph):
order.extend(list(part))
# order.reverse()
### INITIALIZE DISTANCE MATRIX
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