For a permutation σ of length 3, we define the oriented graph Q_n(σ). The graph Q_n(σ) is obtained by imposing edge constraints on the classical oriented hypercube Q_n, such that each path going from 0ⁿ to 1ⁿ in Q_n(σ) bijectively encodes a permutation of size n avoiding the pattern σ. The orientation of the edges in Q_n(σ) naturally induces an order relation ≼_σ among its nodes. First, we characterize ≼_σ. Next, we study several enumerative statistics on Q_n(σ), including the number of intervals, the number of intervals of fixed length k, and the number of paths (or permutations) intersecting a given node.