Algorithm Visualizer

Interactive tool I built for visualizing graph algorithms, sorting techniques, and tree traversals. Step through each operation and inspect the underlying data structures in real-time

Graph Algorithms

Dijkstra's Algorithm

Find the shortest path from a source node to a specific target or all other nodes in a weighted graph.

Prim's Algorithm

Construct a minimum spanning tree for a weighted, connected, undirected graph.

Breadth-First Search

Explore a graph level by level, finding the shortest path in unweighted graphs.

Depth-First Search

Explore a graph by going as deep as possible before backtracking.

Topological Sort

Linear ordering of vertices in a directed acyclic graph (DAG) respecting dependencies.

Sorting Algorithms

Quick Sort

Efficient divide-and-conquer sorting algorithm with in-place partitioning.

Search Algorithms

Binary Search

Efficiently search for elements in a sorted array with O(log n) time complexity.

Two-Pointer Algorithm

Efficient technique for finding pairs in a sorted array that sum to a target value.

Tree Algorithms

BST Traversal

Explore binary search trees using inorder, preorder, and postorder traversal methods.