For networks that are directed or can be represented by a directed network,reversing one or more of theuni-directional links may provide the ability to reconnect a network that has been disconnected by link failure,In this paper,a new approach to reconfigure such networks is proposed.We develop a linear time algorithmwhich,when reachability has been destroyed by the removal of a single link,optimally restores teachabilitythrough the reversal of selected links.Multi-link failure reconnectability is discussed and an algorithm withpolynomial complexity is given which provides a nearly optimum solution to reconnect the network.We showthat the reliability of a network that allows reversals is at least twice more than that in which reversals are notpermitted.Unfortunately,the reconnection of some networks cannot be established.Therefore,we discuss themaximization of reachability of such networks so that each node can reach maximum number of the othernodes. For networks that has directed or can be represented by a directed network, reversing one or more of theuni-directional links may provide the ability to reconnect a network that has been disconnected by link failure, In this paper, a new approach to reconfigure such networks is proposed.We develop a linear time algorithmwhich, when reachability has been destroyed by the removal of a single link, optimally restores teachabilitythrough the reversal of selected links.Multi-link failure reconnectability is discussed and an algorithm withpolynomial complexity is given which provides provides for nearly optimum solution to reconnect the network.We showthat the reliability of a network that allows reversals is at least twice more than that in which reversal are notpermitted. Unfortunately, the reconnection of some networks can not be established. Herefore, we discuss the maximization of reachability of such networks so that each node can reach maximum number of the othernodes.