kahn s algorithm is used to find topological ordering of directed acyclic graph using bfs adjacency list of graph kahn s algorithm is used to find topological ordering of directed acyclic graph using bfs adjacency list of graph
def topological_sort(graph):
    
    indegree = [0] * len(graph)
    queue = []
    topo = []
    cnt = 0

    for values in graph.values():
        for i in values:
            indegree[i] += 1

    for i in range(len(indegree)):
        if indegree[i] == 0:
            queue.append(i)

    while queue:
        vertex = queue.pop(0)
        cnt += 1
        topo.append(vertex)
        for x in graph[vertex]:
            indegree[x] -= 1
            if indegree[x] == 0:
                queue.append(x)

    if cnt != len(graph):
        print("Cycle exists")
    else:
        print(topo)



graph = {0: [1, 2], 1: [3], 2: [3], 3: [4, 5], 4: [], 5: []}
topological_sort(graph)