In graph theory [Graph theory] and combinatorial optimization, a closure of a directed graph [Directed graph] is a set of vertices [Vertices] C, such that no edges [Edge] leave C.

(“Closure Problem” 2020)

In graph theory [Graph theory] and combinatorial optimization, a closure of a directed graph [Directed graph] is a set of vertices [Vertices] C, such that no edges [Edge] leave C.

(“Closure Problem” 2020)