This paper addresses the designability of Boolean networks, i.e., the existence of a Boolean function satisfying an attractor condition under a given network structure. In particular, we present here a necessary and sufficient condition of the designability of Boolean networks with multiple attractors. The condition is characterized by the cyclicity of network structures, which allows us to easily determine the designability.