Let Tn denote the full transformation semigroup on the finite set = {1, 2, … n}, that is the set of all mappings from to , with function composition as the semigroup operation. In this paper algorithms are introduced to solve equations such as axmb = c and ax = xb (a, b, c ∊ Tn), which employ a representation of members of Tn as special directed graphs.