Word Count : 331

---

### Algorithm for Topological Sort (Kahn’s Algorithm) Input: A directed acyclic graph (DAG) with `n` vertices and `m` edges. Output: A topological ordering of the vertices. --- ### Steps: 1. Compute in-degree for each vertex: - Initialize an array `in_degree` of size `n` with all zeros. - For each edge `(u, v)`, increment `in_degree[v]` by 1. 2. Initialize a queue: - Enqueue all vertices with `in_degree = 0` (i.e., no incoming edges). 3. Topological Sort Process: - Initialize an empty list `topo_order` _________ ___ ______ ________ _______ ____ ____.
_____ ________ __________ _________ _________ _______ ________ _________ ____.
_____ ____ ___ __________ _________ ______ _________ __________ ________ ____ _______ ______.
________ ____ ___ ______ __________ __________ _________ _________ ____ ________ _________.
________ _________ _____ ___ ________.
______ ________ _________ _____ _______ ___ ______ __________ __________ _______.
________ __________ ___ ___ __________ ____.
___ ___ _______ ________ __________ _________ ___ ____ __________ ___.
_________ ______ _______ _____ ________.
_________ ________ __________ __________ ____ _________ _________ ______ _______.
_________ ___ ________ _________ ________ _________.
______ ___ ____ _________ ___.
______ __________ _____ ______ ________ _______ __________ ______ ___ _________.
_________ _________ __________ ________ _____ ______.
_____ _________ ________ ________ __________ ________ __________ ____.
________ ___ ____ ________ ________ __________.
_____ ________ _______ ________ ________ ________ _________ ___ ______ ________.
_______ _________ _____ ______ __________ _______ ___ ____.
__________ _________ __________ ____ _______ ____ __________ ___ _________ _______.
_________ _________ ______ __________ _____ ____.
_________ ___ ________ ____ ____ _________ _________ ______ __________.
_______ _______ _______ ____ _____ _______ ____ ____.
_______ _________ _____ _____ __________.
_______ _________ ____ ___ _______ ____ _________ __________ ________.
__________ _____ ______ _______ __________.
________ ____ _____ ______ ________ _____ ____ _________ _______ ___.
_______ _____ __________ ___ ____ ______ _______.
____ ________ _________ _____ _____ __________.
________ ________ ________ ________ _______ _____ ____ _______ ___ _______ _________.
_______ ________ ___ ________ ____.
_____ ______ ____ _______ _________ ____ __________ _________ ________ ________.
__________ ___ _________ _______ ________.
Get Full Answer on WhatsApp