UPC-5211 - The Maximum Unreachable Node Set - 最小路径覆盖
题目链接：http://exam.upc.edu.cn/problem.php?id=5211题目：题目描述In this problem, we would like to talk about unreachable sets of a directed acyclic graph G = (V, E). In mathematics a directed acyclic graph (...