This is a preview. Log in through your library . Abstract 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 ...