Stanton and White's Constructive Combinatorics emphasizes bijective proofs, and enumerative algorithms (with the theoretical insights that follow from the analysis thereof). The approach beautifully bridges the cultures of mathematics and computer science. I think undergraduates appreciate seeing powerful theoretical methods that nevertheless don't involve much abstraction. The contrast here would be to generating function methods, for which one would need a separate source.