One of the adjacent fields of combinatorial reconfiguration is enumeration problems. An enumeration problem is a problem of outputting all solutions satisfying given constraints without duplication and is a fundamental field in theoretical computer science. Several frameworks have been proposed for constructing algorithms for solving enumeration problems. One of them is called the supergraph technique. The supergraph technique enumerates solutions by traversing on a solution graph whose vertices are solutions. In this talk, I will introduce an overview of how to construct enumeration algorithms based on the supergraph technique.