MaximalCardinalitySearch.I
module Gr : Sig.I
type edgelist = (Gr.V.t * Gr.V.t) list
val mcsm : Gr.t -> (int * Gr.V.t) list * edgelist
mcsm g return a tuple (o, e) where o is a perfect elimination order of g' where g' is the triangulation e applied to g.
mcsm g
(o, e)
g'
e
g
val triangulate : Gr.t -> unit
triangulate g triangulates g using the MCS-M algorithm
triangulate g