Compute a minimal vertex cutset of a reducible oriented graph.
S of vertices is a cutset of
G \ S doesn't
contain any cycle.
Based on the article: A linear time algorithm for finding minimum
cutsets in reducible graphs by A. Shamir (1979).
module type G =