A closure in a directed graph is a subset of nodes, all of whose successors belong to the subset. If each node has an assigned weight, which may be positive or negative, the maximal closure problem is ...