A new algorithm for computing reliability of network with node failure is presented in this paper. Based on the principle of disjoint algebra and synergetic computing, the disjoint minimal path set is gotten directly by means of node information exchanging. The algorithm is simple and characterized by distributed computing. It provides a new approach to computing reliability of large scale network.