I think that would be the case ...I would have to think. Should reflexive and transitive operations I think on the finite graph (possibly with equations).<br><br>Vasili<br><br><div class="gmail_quote">On Wed, Mar 23, 2011 at 5:26 PM, Luke Palmer <span dir="ltr"><<a href="mailto:lrpalmer@gmail.com">lrpalmer@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;"><div class="im">On Wed, Mar 23, 2011 at 3:58 PM, Vasili I. Galchin <<a href="mailto:vigalchin@gmail.com">vigalchin@gmail.com</a>> wrote:<br>
> Hello,<br>
><br>
> Does there exist Haskell to generate a finite free category from a<br>
> finite multipath graph with loops?<br>
<br>
</div>AKA the transitive closure of a graph?<br>
<font color="#888888"><br>
Luke<br>
</font></blockquote></div><br>