Counting & Probability · Superchallenge problem

Five points are labelled $1,2,3,4,5$, and a network is formed by choosing any set of the $10$ possible connections between pairs of points (from none of them to all of them), giving $2^{10}=1024$ networks. In how many of these networks is every point connected to at least one other point?