Module Mincut

module Mincut: sig .. end
Minimal cutset of a graph

Compute a minimal vertex cutset of a reducible oriented graph. The set S of vertices is a cutset of G if 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 = sig .. end
Minimal signature for computing the minimal separators
module Make: 
functor (G : G) -> sig .. end