In this paper, we investigate the problem of enumerating all Hamihonian circuits both in the complete graph and in the non-complete graph, and,for each case, develop the procedure. As to the speed and computer memory required,both the procedures gain an advantage over the existent ones. Furthermore, their performances in testing a graph for the Hamihonian characteristic are encouraging.