def topological_sorting(graph):
    # The topological sorting of a DAG is equivalent to its reverse postordering.
    order = depth_first_search(graph)[2]
    order.reverse()
    return order
Initialize the api loggers.
dataset/ETHPy150Open pmatiello/python-graph/core/pygraph/algorithms/sorting.py/topological_sorting--crossover with--dataset/ETHPy150Open IceCTF/ctf-platform/api/api/logger.py/setup_logs