s/reeb/mergetree.html#cereeberus.reeb.merge.MergeTree">[docs]</a>
<span class="k">class</span> <span class="nc">MergeTree</span><span class="p">(</span><span class="n">ReebGraph</span><span class="p">):</span>
<span class="w">    </span><span class="sd">&quot;&quot;&quot; </span>
<span class="sd">    A merge tree stored as a ``ReebGraph`` object. Like a Reeb graph, this is a directed graph with a function defined on the vertices. However, in a merge tree, the function is required to iave a single root with 