Back to projects
PROJECT

Topological Sort Visualizer

An interactive visualizer for Topological Sort using BFS / Kahn's Algorithm with dynamic graph creation and step-by-step node processing.

Adjacency-list graph construction with queue-based Kahn's algorithm rendered step by step.

DAG / KAHN'S ALGORITHMILLUSTRATIVE
TECH STACK
HTMLCSSJavaScript
WHAT I BUILT
  • Built an interactive visualizer to demonstrate Topological Sort using BFS (Kahn's Algorithm).
  • Implemented graph creation using adjacency list representation with dynamic edge input.
  • Visualized node processing order step-by-step to improve conceptual understanding of DAG traversal.
  • Applied queue-based algorithm logic to simulate real-time topological ordering.
  • Used DOM manipulation and event-driven updates to render graph changes interactively.