INNER CODE UNIT · Python

main

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

def main(graph, source, target, max_length):
    alp_list = []
    dag = make_dag(graph)
    tree = nx.DiGraph()
    tree_nodes = {}
    tree_levels = {}
    level = 0
    predecessor = 'null'
    weight = 0
    c = 2
    tree_levels[level] = [source]
    tree_nodes[source] = {}
    tree_nodes[source][level] = (predecessor, weight)
    tree.add_node((source, level))

    for level in range(max_length + 1):
        tree_levels[level + 1] = []
        for nodes in tree_levels[level]:

View source record →