** Introducing: Graph Algorithm Visualizer**

A tool to see algorithms in action — built for learners, developers, and competitive programmers.

Hi Codeforces!!

I'm excited to share a project I’ve been building — a fully interactive Graph Algorithm Visualizer that helps you learn and understand common graph algorithms through intuitive visualizations.

Whether you're preparing for contests, brushing up on data structures, or exploring graph theory for the first time, this tool can help you see how algorithms actually behave.

Try it out:

Live Demo →See live GitHub Repo → Github Repo

Features:

Draw and edit custom graphs (add/remove/move nodes and edges)

Supports both Directed and Undirected graphs

Handles Weighted and Unweighted edges

Toggle Light/Dark mode

Speed-run mode to fast-forward animations

Responsive UI and smooth node/edge highlighting

Implemented Algorithms:

DFS (Depth-First Search)

BFS (Breadth-First Search)

SCC (Strongly Connected Components via Kosaraju's Algorithm)

Cycle Detection (for both directed and undirected graphs)

Prim's MST (visualizes minimum spanning tree step-by-step)

Kruskal's MST (with union-find visualization approach)

Eulerian Circuit and Eulerian path (Hireholzer's algorithm)

Dijkstra's algorithm (result will be shown in show result button given below.)

All algorithms are animated in real time, preserving the connectivity of the graph and clearly showing what's being visited or selected.

Suggest me more algorithms to add.

Open Source

The project is open-source and actively maintained. I'm open to suggestions, improvements, bug reports, or even collaborations. If you like the project, a ⭐ on GitHub would mean a lot!

Thanks for checking it out! Feedback and ideas from the Codeforces community would be super valuable. Let me know what features you’d like to see next.