Send Beginners mailing list submissions to
[email protected]
To subscribe or unsubscribe via the World Wide Web, visit
http://www.haskell.org/mailman/listinfo/beginners
or, via email, send a message with subject or body 'help' to
[email protected]
You can reach the person managing the list at
[email protected]
When replying, please edit your Subject line so it is more specific
than "Re: Contents of Beginners digest..."
Today's Topics:
1. Re: *** GMX Spamverdacht *** Re: Relatively simple
undirected graph library? (Tim Holzschuh)
----------------------------------------------------------------------
Message: 1
Date: Tue, 06 Jan 2015 09:55:16 +0100
From: Tim Holzschuh <[email protected]>
To: [email protected], The Haskell-Beginners Mailing List -
Discussion of primarily beginner-level topics related to Haskell
<[email protected]>
Subject: Re: [Haskell-beginners] *** GMX Spamverdacht *** Re:
Relatively simple undirected graph library?
Message-ID: <[email protected]>
Content-Type: text/plain; charset=windows-1252; format=flowed
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
> [email protected] http://www.haskell.org/mailman/listinfo/beginners
------------------------------
Subject: Digest Footer
_______________________________________________
Beginners mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/beginners
------------------------------
End of Beginners Digest, Vol 79, Issue 8
****************************************
