Skip to content

Latest commit

 

History

History
7 lines (4 loc) · 644 Bytes

File metadata and controls

7 lines (4 loc) · 644 Bytes

Dyck Paths Visualizer (dyckvis) · MIT License

A dyck path is a sequence of steps in a $n\times n$ grid from (0, 0) to ($n$, $n$) that lies strictly below, or touching, the diagonal line. The number of dyck paths in an $n\times n$ grid is given by the $n$-th catalan number,

$$\displaystyle \LARGE C_n=\frac{1}{n+1}\binom{2n}{n}$$

dyckvis is a visualizer that shows every dyck path given a value for $n$.