I'm working my way through Meier's Groups, Graphs and Trees and I'm confused by the proof he gives for one of Cayley's Theorems, namely
Every finitely generated group can be represented as a symmetry group of a connected, directed, locally finite graph.
The proof basically begins by constructing something very similar to Cayley graph, then when it comes to proving connectedness it seems to me that the directedness of the graphs is just brushed over without consideration. So are Cayley graphs weakly connected, in the sense that they are connected only when we ignore direction, or are they strongly connected?
If your generators are finite order, then Cayley graphs are composed of cycles, so are strongly connected. If not, then indeed, they are only weakly connected: for example, in the Cayley graph of the free group on $n$ generators with respect to those free generators, there is no path to the vertex corresponding to the identity from the vertex corresponding to any one of those generators.