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