For distinct vertices $u$ and $v$ in a graph $G$, the {\em connectivity} between $u$ and $v$, denoted $κ_G(u,v)$, is the maximum number of internally disjoint $u$--$v$ paths in $G$. The {\em average connectivity} of $G$, denoted $\overlineκ(G),$ is the average of $κ_G(u,v)$ taken over all unordered pairs of distinct vertices $u,v$ of $G$. Analogously, for a directed graph $D$, the {\em connectivity} from $u$ to $v$, denoted $κ_D(u,v)$, is the maximum number of internally disjoint directed $u$--$v$ paths in $D$. The {\em average connectivity} of $D$, denoted $\overlineκ(D)$, is the average of $κ_D(u,v)$ taken over all ordered pairs of distinct vertices $u,v$ of $D$. An {\em orientation} of a graph $G$ is a directed graph obtained by assigning a direction to every edge of $G$. For a graph $G$, let $\overlineκ_{\max}(G)$ denote the maximum average connectivity among all orientations of $G$. In this paper we obtain bounds for $\overlineκ_{\max}(G)$ and for the ratio $\overlineκ_{\max}(G)/\overlineκ(G)$ for all graphs $G$ of a given order and in a given class of graphs. Whenever possible, we demonstrate sharpness of these bounds. This problem had previously been studied for trees. We focus on the classes of cubic $3$-connected graphs, minimally $2$-connected graphs, $2$-trees, and maximal outerplanar graphs.