What do you call a fully connected directed graph where each node has at most one outbound edge?
A fully connected directed graph where each node has at most a one inbound edge is a tree. Does a fully connected directed graph where each node has at most a single outbound edge have a name? Anti-tree?!