Problem: Find the number of ways to connect a graph having 5 labeled nodes so that each node is reachable from every other node.
I have solved this problem using principle of inclusion and exclusion and I got answer 728. But I want to know how to solve this problem using generating function.