I sketch the proof of the following theorem: if a finite reflexive digraph admits a near unanimity operation ( or equivalently Gumm operations), then it also admits a totally symmetric idempotent operation of every arity. This result has recently been obtained in a joint research with Miklos Maroti and is a common generalization of earlier results on posets and reflexive symmetric digraphs.