conceptofmind

def topological_sort_nx(files):
    graphs = nx.DiGraph()
    for file in files:
        graphs.add_node(file)

    for fileA in files:
        for fileB in files:
            if has_dependency(fileA, fileB):
                graphs.add_edge(fileB, fileA)