A graph $G$ is called 'unicyclic' if it is connected and contains exactly one cycle. If $G$ has $n$ vertices, how many edges does it have?