Kahn's Algorithm Visualization

Kahn's Algorithm is a method for finding a topological order in a Directed Acyclic Graph (DAG). The algorithm repeatedly removes nodes with no incoming edges (in-degree = 0) from the graph and adds them to the result. If, at any point, there are no nodes with in-degree 0 and not all nodes are processed, a cycle exists, and topological sorting is not possible.

Practical Applications: Topological sorting has a wide range of practical applications, including:

• Course Scheduling: Finding a valid ordering of courses with prerequisites, ensuring each course is taken after its dependencies.
• Task Scheduling: Organizing tasks in a workflow where some tasks must be completed before others, such as in project management or build systems.
• Dependency Resolution: Ensuring the correct order of library or package installations, where some libraries depend on others.
• Compilers: Resolving dependencies in the compilation of code, such as determining the order of file compilation in a programming project.
• Circuit Design: Identifying a valid sequence for placing components in electronic circuit design.

This visualization processes nodes one by one, showing the order of processing and highlighting the edges traversed. The log below displays step-by-step updates, including nodes being added to the result or queue and any cycle detection.