jmc

For each vertex, we can create a diagonal by connecting it to any non-adjacent vertex. If there are $n$ vertices, there are $n(n-3)$ diagonals we draw. But we are over-counting by a factor of 2 since each diagonal can be created from 2 vertices. So there are $n(n-3)/2$ diagonals. In this problem, since $n=7$, there are $7\cdot 4/2=\boxed{14}$ diagonals.