Andrey Mokhov

@evanrelf Great, thanks for sharing your experience! Unless someone else beats me to it, I'm going to add this function to the library as soon as I find some time.

@infinity0 I found that trying to squeeze graph algorithms into type classes falls apart pretty quickly, but I'm open for experiments. As an example, I had to ditch type classes...

Thanks! > AFAICT, and correct me if I'm wrong, but there are effectively two kinds of representations here - one based on adjacency maps, and one based on your algebraic...

I'm not aware of any progress in the context of this library. I remain a little sceptical of the goal of writing graph algorithms against an abstract interface because implementations...

@dataopt Are you saying that LEDA implements graph algorithms against an abstract graph interface? If yes, could you point to an example?

Got it. Thanks for the links, they are new to me too! (Oops, actually, I did come across the master thesis before but never had a chance to read it...

Thanks to @gabrielelana and @sphaso we now have a simple implementation: #237. There is a lot of room for improvement though, since the current complexity is O(n^2 * m) time...

@fawaz990 Please use English so that as many people as possible could participate without relying on Google translate.

Hi Dominik, thanks for reaching out and for writing a nice blog post about Alga! (I found only one little typo: you first say "string decomposition" and then "strong decomposition".)...

OK, let's keep this issue open. Perhaps, it's possible to somehow express and manipulate undirected trees algebraically.