2015•Journal of Suzhou University of Science and TechnologyRequires access
Research on the incremental updating of the transitive closure
Wang Xiaoya
Open publisher page 0 citations
Abstract
Aimed at the updating problem for transitive closure when ordered pairs added to a binary relation,we put forward a new transitive closure algorithm. Based on this new transitive closure algorithm,the paper proposed a new method for the incremental updating of the transitive closure. According to the different ordered pairs added to a binary relation,the transitive closure of the new binary relation can be obtained by simply updating the original transitive closure. Using this method,we can achieve the solution for the transitive closure of a dynamic binary relation more effectively.