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