Let $G=(V,E)$ be a simple directed graph, where $V$ is any set. By "simple directed graph" means that there exists at most one edge from $u$ to $v$ for $u,v\in V$ (i.e, a directed graph can have loops but not multiple ...