  We discuss such Maltsev conditions that consist of just one linear equation,
we call them loop conditions. To every such condition can be assigned a graph.
We provide a classification of conditions with undirected graphs. It follows
that the Siggers term is the weakest non-trivial loop condition.
