Improved algorithm for construction of essential graph

This paper proposed an improved algorithm for the construction of the essential graph by using the related knowledge of graph theory. Numerical experiment shows that it is relatively faster to determine the essential graph of acyclic directed graphs with more V-structures by employing the improved algorithm,thus the study of equivalence classes becomes better.