callcc

module type S =
sig
module P : Path.S
(** The type of matchings *)
type t
(** The edge set of a matching *)
val edges : t -> P.G.E.t
(** The set of vertices covered by a given matching *)
val covered : t -> P.G.V.t
(** The set of vertices not covered by a given matching *)
val uncovered : t -> P.G.V.t
(** The graph on which the matching is defined *)
val graph : t -> P.G.graph
(** an empty matching in a given graph *)
val empty : P.G.graph -> t
(** adding an edge into a matching *)
val add_edge : t -> P.G.edge -> t
(** removing an edge from a matching *)
val remove_edge : t -> P.G.edge -> t
(** [matched_to m u] is [None] if [u] is not matched in [m], or [Some (e,v)] where [e] is
the edge of [m] containing [u] and [v] is its other endpoint.
*)
val matched_to : t -> P.G.vertex -> (P.G.edge * P.G.vertex) option
(** [contract_blossom m cycle], given an alternate cycle of odd length,
where the endpoint of [cycle] is the vertex not matched inside [cycle],
contracts [cycle] in the subjacent graph and the matching, leaving only this endpoint.
*)
val contract_blossom : t -> P.t -> t
(** [augment m path], where [p] is an augmenting path, returns a new matching
obtaind by symmetric difference with the edge set of [path] *)
val augment : t -> P.t -> t
end

Matching.S