INNER CODE UNIT · Python

make_dag

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

def make_dag(graph):
    dag = nx.DiGraph()
    for key1 in graph.keys():
        for key2 in graph[key1].keys():
            dag.add_weighted_edges_from([(key1, key2, graph[key1][key2])])
    return dag


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

View source record →