English: Given a set S, and any selfmap ƒ: S→S, the functional graph associated with ƒ can be described as a graph with vertex set S and directed edge set E = {(u; v) ϵ S2 : ƒ (u) = v}. A classification of all functional ...