The Euler path visits each edge exactly once. The Euler cycle (or circuit) is an Euler path starting and ending on the same vertex. The Hamiltonian path visits each vertex exactly once.

Does your book define the Euler cycle in the context of a connected graph? If not, then it is simply impossible to visit all the vertices by visiting all the edges - you could have an isolated vertex somewhere.