Visualize graph algorithms like dijkstra, BFS, DFS
Build a graph and watch BFS and DFS explore it node by node
Weighted graphs with Dijkstra and Bellman-Ford, including negative-cycle detection
Build a weighted graph and watch Kruskal and Prim grow the minimum spanning tree
Build a graph and color its connected components and strongly connected components
Compute max flow / min cut with Edmonds-Karp and Ford-Fulkerson on a capacity network
Insert, delete, and search on a BST with animated tree restructuring
The process in which a function calls itself directly or indirectly is called recursion
Compare different sorting algorithms
Compare different recursive sorting algorithms
The N queens puzzle is the problem of placing N chess queens on an N*N chessboard so that no two queens threaten each other
A Turing machine is a mathematical model of computation that defines an abstract machine that manipulates symbols on a strip of tape according to a table of rules
Visualize how Seive is better than brute force
The convex hull of a set of points is the smallest convex polygon that contains all the points of it
Binary search is an efficient algorithm for finding an item from a sorted list of item
Visualize the Game of Life cellular automaton
Visualize insertion, deletion, search, and reversal on singly and doubly linked lists