← Jad Salem

Interactive

Small things you can operate.

Graph algorithms

Grid connectivity with depth-first search

Draw a crossword grid and watch a depth-first search run decide whether its white squares are connected. Cells are colored based on their enter and exit numbers, and the DFS tree is shown.

Construction

Crossword constructor

Lay out a grid under a chosen symmetry, check it is legal, fill it with the help of a word list, write the clues, and print it.