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?
Atcoder ABC #351 Short Solution Discussion
Codeforces Round 941 (Div 1 + 2) Solution Discussion (with Jan)