An f-graph is a directed graph where each vertex has outdegree 1. That is, each vertex has exactly one arrow coming out of it.

An r-graph is a directed graph with no multiple edges. That is, for vertices $u$, $v$, there can be at most one edge from $u$ to $v$.

Is every f-graph also an r-graph? Explain.