MaximalCardinalitySearch.P
module G : Sig.P
type edgelist = (G.V.t * G.V.t) list
val mcsm : G.t -> (int * G.V.t) list * edgelist
mcsm g returns 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)
o
g'
e
g
val triangulate : G.t -> G.t
triangulate g computes a triangulation of g using the MCS-M algorithm
triangulate g