Summary: We first characterize in a simple combinatorial way all finite graphs whose edges can be directed to form an \(n\)-functional digraph, for a fixed positive integer~\(n\). Next, we prove that the possibility of directing the edges of an infinite graph to form an \(n\)-functional digraph depends on its finite subgraphs only. These results generalize Ore's result for functional digraphs.