We consider directed figures defined as labelled polyominoes with designated start andend points, with two types of catenation operations. We are especially interested in codicityverification for sets of figures, and we show that depending on the catenation type the questionwhether a given set of directed figures is a code is decidable or not. In the former case we give aconstructive proof which leads to a straightforward algorithm.