Isomorphisms and algorithmic properties of structures with two equivalences are considered using definability methods (developed by the author) for a graph in a bipartite graph and in a structure with two equivalences, which respect algorithmic and syntactic properties of the original structure.