module P:
| Parameters: |
|
typeedgeset =(G.V.t * G.V.t) list
val md : G.t -> G.t * edgeset * G.V.t listmd g return a tuple (g', e, o) where g' is
a triangulated graph, e is the triangulation of g and
o is a perfect elimination order of g'val triangulate : G.t -> G.ttriangulate g return the graph g' produced by applying
miminum degree to g.