An algorithm is derived for the inversion of a matrix which makes use of the structure of the associated flow graph. The flow graph is explored with the help of Boolean matrices in order to determine an efficient strategy for successive elimination of variables. The algorithm reduces the given matrix to a triangular one of lower order which is readily inverted.