[Haskell-beginners] Relatively simple undirected graph library?

[Stefan Höck]

OK, I'll try and clean up the code and put it on GitHub. Mind that it's
no big thing so far, but will hopefully evolve to something useful ...

On Tue, Jan 06, 2015 at 09:55:16AM +0100, Tim Holzschuh wrote:
> Hi Stefan!
> 
> Although I don't need such a library for the moment, and although I'm still
> a beginner and I probably won't be able to improve your library I'd still
> love to see it on GitHub - just to check your code.
> 
> So if you don't mind to have it online "for free" it would be really nice,
> if you'd put it on your GitHub!
> 
> Thanks,
>     Tim
> 
> Am 05.01.2015 um 05:26 schrieb Stefan Höck:
> >Hi Stu I also was in need of a graph library comparable to what you
> >describe, which I'd like to use later on to represent molecular graphs in
> >cheminformatics projects. Since I did not find anything that fit my needs
> >on Hackage, I started writing my own implementation. The code is not ready
> >for anything and so far it's only unlabeled graphs. However, adding
> >labelings later on is - from my experience - no big thing as most of the
> >graph algorithms need only be implemented for unlabeled graphs. If you are
> >interested, I could clean up the code and put it on github, then we could
> >work on it together. Many of the things you need like creating edge- and
> >vertex-induced subgraphs will require only very little work. The same goes
> >for extracting connected subgraphs and filtering by edge or vertex type.
> >Stefan _______________________________________________ Beginners mailing
> >list Beginners at haskell.org
> >http://www.haskell.org/mailman/listinfo/beginners
>