Abstract: Solving transitive closure is a classical problem in computer science.In this paper,the author proposes a new transtive closure algorithm,and deduces out some theoretical results.The results can change any relation graph into left deflective order graph.The algorithm is a depth first searching algorithm based on backtracking spread information and coding technique.It is effective,and its realizing is easy.