Algorithm for constructing 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 graph is a digraph obtained from a circuit by some orientation of its edges. An algorithm is proposed to construct a T-irreducible extension for a polygonal graph. Correctness of the algorithm is proved.