A *digraph* (direct graph) consists of a set $V$ of vertices and a set $E$ of directed edges $v\to v'$. A *multidigraph* is a digraph in which $E$ is a multiset, so edges may appear multiple times in $E$, or equivalently, $E$ is a set of directed edges that are assigned multiplicities.


Is there a standard name for a multidigraph with the following property? For each vertex $v\in V$, there is at most one $v'\in V$ such that the edge $v\to v'$ is in $E$, although that edge is of course allowed to appear multiple times in $E$. 


I looked through the list of various types of graphs on Wikipedia, but didn't see this one. (For a digraph that's not "multi", one could say "digraph with all out-degrees 0 or 1," but even that seems clumsy.)



Is there a standard name for this type of multidigraph?
I haven't seen the multigraph version, but non-multi directed graphs with at most one outgoing neighbor per vertex have been called [directed pseudoforests](https://en.wikipedia.org/wiki/Pseudoforest), and with exactly one outgoing neighbor they are also called functional graphs or maximal directed pseudoforests.


