Visualizations of popular computer science algorithms
Simulates a matrix of cells, where each cell is either alive (green) or dead (grey). The following rules decide which cells get to live and which ones die:
- Any live cell with two or three live neighbours survives.
- Any dead cell with three live neighbours becomes a live cell.
- All other live cells die in the next generation. Similarly, all other dead cells stay dead.
More info can be found here
Uses union-find paradigm to find whether the system percolates - i.e. if there is a connected path from the top of the grid all the way to the bottom
Deployed at: percolation-chi.vercel.app
Demonstration of Jarvis March algorithm used for finding the convex hull of a set of randomly arranged points in a 2D plane
Deployed at: convexhull.vercel.app
Demonstration of kruskal's algorithm to find mst of a graph. Edge weights are proportinal to the edge lengths.
Deployed at: kruskals.vercel.app