Abstract The topological sort is an important operation of directed graph s.Th is paper p resents a linear algorithm to obtain a more reasonable topological sorting in the directed acyclic graph.