I\'m currently solving an algorithm question, Given a directed acyclic graph G = (V; E), there is only one point s (starting point) with indegree zero and one vertex with ou