The new neural network algorithm for searching graph minimal cut set,called NNMC algorithm, is established on the basis of construction of Hopfield Network energy function according to the concrete problem.In NNMC algorithm, which suffciently uses the fast convergence of Hopfield Network, a way to avoid the local minimum is carried out.