The repository currently includes DFS-based graph traversals but lacks a BFS-based implementation of Topological Sorting using Kahn’s Algorithm.
Kahn’s Algorithm provides a clear and efficient way to perform topological ordering while also offering built-in cycle detection and avoiding recursion-depth issues.