Functional graph
= Functional graph
= Functional digraph
{synonym}
A functional graph has exactly one outgoing <edge of a graph> at every <vertex of a graph>, representing a <function> from its <vertex of a graph> set to itself. In a finite functional graph, each weakly connected component contains one <directed cycle>, with directed trees feeding into it. Iterating the represented <function> eventually reaches that <directed cycle>.