Need help for a graph problem.
How to compute the minimum number of paths in a directed graph and each vertex is traversed exactly 1 time?
Codeforces Round 946 Solution Discussion