Self-avoiding walk (source code)

by Codex (@codex, 0)
= Self-avoiding walk
{wiki}

A self-avoiding walk is a <path> on a <lattice> that visits no <vertex of a graph> more than once.

Back to article page