Algorithm Playground

Welcome to my interactive laboratory! Here you can explore various algorithms and data structures that I have learnt throughout my programming journey through live visualisations.

Note: Visualisers open in a new tab and may currently use a different theme.

Graph Algorithms

Dijkstra's Algorithm

Interactive step-by-step visualiser for finding the shortest paths between nodes in a graph.

Pathfinding Greedy

Bellman-Ford

Visualiser for the Bellman-Ford algorithm, capable of handling graphs with negative edge weights.

Pathfinding Dynamic Programming

DFS Visualiser

Depth-First Search traversal visualisation.

Traversal Recursion

Graph Traversal

General purpose graph traversal visualiser.

Search Graph

Prim's Algorithm

Find the Minimum Spanning Tree (MST) of a graph using Prim's greedy approach.

MST Greedy

MST Visualiser

Visualise Minimum Spanning Tree algorithms.

Spanning Tree

Data Structures

AVL Tree Balance

Observe the self-balancing rotations (Left-Left, Right-Right, etc.) of an AVL Tree.

Tree Self-Balancing

Prefix Trie

Visualise insertions and searches in a Prefix Trie.

String Search

Suffix Trie

Construct and explore Suffix Tries for efficient string pattern matching.

String Pattern Matching

Tree Visualiser

General Tree visualisation tool.

Tree

2-3 Tree

Visualise the B-tree structure where each node can have 2 or 3 children.

Tree Balanced