Visualizing Vandermonde's determinant through nonintersecting lattice paths

We use the Lindström–Gessel–Viennot Theorem to count nonintersecting lattice paths in a carefully chosen acyclic weighted digraph to give a visual combinatorial proof of Vandermonde's classic determinant.