An Efficient Algorithm for Constructing Hierarchical Graphs

An algorithm to delete redundant edges from a precedence graph is presented and proved correct. The algorithm is much more efficient than previous algorithms to perform the same task.