T-irreducible extension of polygonal digraphs

Directed graphs are mathematical models of discrete systems. T-irreducible extensions are widely used in cryptography and diagnosis of discrete systems. A polygonal origraph is a digraph obtained from a circuit by some orientation of its edges. We propose an algorithm to construct a T-irreducible extension of a polygonal graph.