A path in a digraph is antidirected if the two adjacent. edges of the path have opposing orientations, In this paper we give a necessary and sufficient, condition for the edges of the complete symmetric graph to be decomposed into isomorphic antidirected
