Let T(q,D) be a self-similar (fractal) set generated by where integer q > 1 and D = {d (1), d (2), aEuro broken vertical bar, d (N) } aS, a"e. To show the Lipschitz equivalence of T(q,D) and a dust-like T(q,C), one general restriction is D aS, a"e by Peres et al. [Israel J Math, 2000, 117: 353-379]. In this paper, we obtain several sufficient criterions for the Lipschitz equivalence of two self-similar sets by using dust-like graph-directed iterating function systems and combinatorial techniques. Several examples are given to illustrate our theory.