A fast algorithm for full-search vector quantisation is proposed, which exploits the statistical properties of the source as well as the topological structure of the codebook. The computational complexity reduces to a few percent relative to the standard full search, and the saving increases with increasing codebook size.