Graph algorithms in SMT solvers

Question

How do I do the following graph algorithms in an SMT solver (either CVC4 or z3)?

1. Given a directed acyclic graph G return all spanning trees T