Abstract
We prove that an idempotent operation generates a loop from a strongly connected digraph containing directed closed walks of all lengths under very mild (local) algebraic assumptions. Using the result, we reprove the existence of weakest non-trivial idempotent equations, and that a finite strongly connected digraph of algebraic length 1 compatible with a Taylor operation has a loop.