Notice of RetractionA New Method of Computing the Reachability Matrix of Directed Graph

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

The reachability matrix of directed graph plays a very important role in identifying whether a directed graph is strongly connective or not and calculating the strongly connective sub graph. It also has a lot of application in structural modeling analysis. But the traditional method to compute the reachability matrix involves enormous calculation work. In this paper, basing on the definition of chain length and method of successive square, a new method is indicated, which can greatly decrease the calculation work. And at last, using pseudocode similar to C language, how to carry out the computation of reachability matrix of a directed graph is put forward.