INNER CODE UNIT · Python

level

lzz19980125/awesome-time-series-segmentation-papers · DASSA-master/ALP.py:89

    level = max_index - 1
    path = []
    while not level == 0:
        path.append(pi)
        pi, p_weight = tree_nodes[pi][level]
        level -= 1
    path.reverse()
    return path, max_value, max_index - c


if __name__ == '__main__':
    graph = sys.argv[1]
    source = sys.argv[2]
    target = sys.argv[3]
    max_length = sys.argv[4]
    # graph, source, target, max_length = generate_test_input()
    path, path_weight, path_length = main(graph, source, target, max_length)
    print(path, path_weight, path_length)

View source record →