Acyclic graphs approximated by finite acyclic graphs are considered. It
is proved that any countably categorical acyclic graph is smoothly approximable. An
example of pseudofinite acyclic graph theory is given, which has an even, odd, and
infinite number of rays.
