  It is known that there are only finitely many mutation-equivalence classes
with a given singularity content, and each of these equivalence classes
contains only finitely many minimal polygons. We describe an efficient
algorithm to classify these minimal polygons. To illustrate this algorithm we
compute all mutation-equivalence classes of Fano polygons with a fixed basket
of singularities in two examples.
