What's New
Recent additions and improvements, newest first.
August 2026
Explore the hierarchy of coverage criteria and see when satisfying one guarantees another. Select a criterion to trace what it guarantees and what guarantees it.
Build control flow graphs from JavaScript or Java source and read off cyclomatic complexity, per function and across the module.
- New
Hebrew translation
The whole site is now available in Hebrew, with full right-to-left layout. Switch languages from the menu.
- Fixed
Theme and language on mobile
Both controls were missing from the mobile menu and are now in its preferences section. The navigation drawer also opens from the correct side in Hebrew.
July 2026
A new section covering combinatorial testing — AETG, IPO, and orthogonal arrays — with editable parameter models.
May 2026
- Improved
Algorithm URLs
Algorithms moved under /algorithms, and every older link now redirects to its new home.
- Fixed
Zoom no longer resets
Stepping through a custom diagram kept resetting the zoom level. It now stays where you put it.
Convert a DFA into an equivalent regular expression, one state elimination at a time.
Computability and complexity, including worked reductions between classic problems.
Build and run PDAs, watching the stack change as input is consumed.
April 2026
Convert a context-free grammar to Chomsky normal form, one transformation step at a time.
- New
FAQ
Answers to common questions about the visualizers and how to use them.
Build CFGs and derive strings step by step, with the parse tree drawn as it grows.
Build finite automata, run input through them one symbol at a time, and watch the active states light up.
- New
Dark mode
Light and dark themes across the whole site, remembered between visits.
A page setting out what the site collects and why.
Define a machine in YAML and step through its execution, following the head as it reads and writes the tape.
March 2026
- Improved
Resizable information panel
The side panel on every visualizer can now be dragged to whatever width suits your screen.
February 2026
Tower of Hanoi, closest pair of points, maximum subarray, and the median of two sorted lists.
Knapsack, longest common subsequence, and maximum subarray, with the table filled in cell by cell.
Binary search, linear search, and the median of two sorted arrays.
Bubble, insertion, bucket, merge, and quick sort, animated as bar charts with every comparison and swap shown.
- New
About page
What this site is for and who builds it.
BFS, DFS, Dijkstra, Bellman-Ford, and Ford-Fulkerson, on graphs you can edit and rearrange.
January 2026
- New
CS Vis launched
The first version of the site, with the interactive graph canvas the visualizers are built on.