<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<link rel="stylesheet" href="style.css" type="text/css">
<meta content="text/html; charset=iso-8859-1" http-equiv="Content-Type">
<link rel="Start" href="index.html">
<link rel="previous" href="Cliquetree.html">
<link rel="next" href="Md.html">
<link rel="Up" href="index.html">
<link title="Index of types" rel=Appendix href="index_types.html">
<link title="Index of exceptions" rel=Appendix href="index_exceptions.html">
<link title="Index of values" rel=Appendix href="index_values.html">
<link title="Index of modules" rel=Appendix href="index_modules.html">
<link title="Index of module types" rel=Appendix href="index_module_types.html">
<link title="Sig" rel="Chapter" href="Sig.html">
<link title="Sig_pack" rel="Chapter" href="Sig_pack.html">
<link title="Dot_ast" rel="Chapter" href="Dot_ast.html">
<link title="Util" rel="Chapter" href="Util.html">
<link title="Persistent" rel="Chapter" href="Persistent.html">
<link title="Imperative" rel="Chapter" href="Imperative.html">
<link title="Delaunay" rel="Chapter" href="Delaunay.html">
<link title="Builder" rel="Chapter" href="Builder.html">
<link title="Classic" rel="Chapter" href="Classic.html">
<link title="Rand" rel="Chapter" href="Rand.html">
<link title="Oper" rel="Chapter" href="Oper.html">
<link title="Path" rel="Chapter" href="Path.html">
<link title="Traverse" rel="Chapter" href="Traverse.html">
<link title="Coloring" rel="Chapter" href="Coloring.html">
<link title="Topological" rel="Chapter" href="Topological.html">
<link title="Components" rel="Chapter" href="Components.html">
<link title="Kruskal" rel="Chapter" href="Kruskal.html">
<link title="Flow" rel="Chapter" href="Flow.html">
<link title="Graphviz" rel="Chapter" href="Graphviz.html">
<link title="Gml" rel="Chapter" href="Gml.html">
<link title="Dot" rel="Chapter" href="Dot.html">
<link title="Pack" rel="Chapter" href="Pack.html">
<link title="Gmap" rel="Chapter" href="Gmap.html">
<link title="Minsep" rel="Chapter" href="Minsep.html">
<link title="Cliquetree" rel="Chapter" href="Cliquetree.html">
<link title="Mcs_m" rel="Chapter" href="Mcs_m.html">
<link title="Md" rel="Chapter" href="Md.html">
<link title="Strat" rel="Chapter" href="Strat.html"><title>Mcs_m</title>
</head>
<body>
<div class="navbar"><a href="Cliquetree.html">Previous</a>
<a href="index.html">Up</a>
<a href="Md.html">Next</a>
</div>
<center><h1>Module <a href="type_Mcs_m.html">Mcs_m</a></h1></center>
<br>
<pre><span class="keyword">module</span> Mcs_m: <code class="code">sig</code> <a href="Mcs_m.html">..</a> <code class="code">end</code></pre>Maximal Cardinality Search (MCS-M) algorithm
<p>
Based on the article:
Maximal Cardinality Search for Computing Minimal Triangulations of Graphs.
by A. Berry, Jean R. S. Blair, Pinar Heggernes & Barry W. Peyton.<br>
<b>Author(s):</b> Matthieu Sozeau, Pierre-Loic Garoche<br>
<hr width="100%">
<pre><span class="keyword">module</span> <a href="Mcs_m.MaximalCardinalitySearch.html">MaximalCardinalitySearch</a>: <code class="code">sig</code> <a href="Mcs_m.MaximalCardinalitySearch.html">..</a> <code class="code">end</code></pre></body></html>
