The purpose of the present paper is to propose an efficient algorithm to enumerate all the minimum feedback edge sets of a given directed graph. The algorithm has been developed in two distinct phases, i.e. all the directed circuits of the given graph are generated at the first phase and then the minimum feedback edge sets are determined from the information of the directed circuits. The proposed algorithm offers easy programmability on a digital computer, and it seems economic in terms of computation time and required storage space.