Send Beginners mailing list submissions to beginners@haskell.org To subscribe or unsubscribe via the World Wide Web, visit http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners or, via email, send a message with subject or body 'help' to beginners-requ...@haskell.org
You can reach the person managing the list at beginners-ow...@haskell.org When replying, please edit your Subject line so it is more specific than "Re: Contents of Beginners digest..." Today's Topics: 1. Graph path (mike h) ---------------------------------------------------------------------- Message: 1 Date: Sat, 5 May 2018 17:50:14 +0100 From: mike h <mike_k_hough...@yahoo.co.uk> To: The Haskell-Beginners Mailing List - Discussion of primarily beginner-level topics related to Haskell <beginners@haskell.org> Subject: [Haskell-beginners] Graph path Message-ID: <e8665a92-f268-4c20-88a1-8aec523c1...@yahoo.co.uk> Content-Type: text/plain; charset=us-ascii Does anyone know of a good description of the algorithm to visit (if possible) each node in a graph? I can find a few links that describe the imperative way of doing it but I struggle converting to functional style :) Many Thanks Mike ------------------------------ Subject: Digest Footer _______________________________________________ Beginners mailing list Beginners@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners ------------------------------ End of Beginners Digest, Vol 119, Issue 1 *****************************************