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).
Vasili On Wed, Mar 23, 2011 at 5:26 PM, Luke Palmer <lrpal...@gmail.com> wrote: > On Wed, Mar 23, 2011 at 3:58 PM, Vasili I. Galchin <vigalc...@gmail.com> > wrote: > > Hello, > > > > Does there exist Haskell to generate a finite free category from a > > finite multipath graph with loops? > > AKA the transitive closure of a graph? > > Luke >
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
