[Haskell-beginners] Graph path

[Henk-Jan van Tuyl]

Maybe
       Structuring Depth-First Search Algorithms in Haskell
       https://galois.com/wp-content/uploads/2014/08/pub_JL_StructuringDFSAlgorithms.pdf
can be of any help? (It's not my field of expertise.)

Since you haven't received any answer for several days on this mailing
list, you might ask this question again on the Haskell Café mailing list,
there are more people reading that list.

Regards,
Henk-Jan van Tuyl


On Sat, 05 May 2018 18:50:14 +0200, mike h <mike_k_houghton at yahoo.co.uk>
wrote:

> 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

-- 
Message from Stanford University:

Folding at home

What if you could share your unused computer power to help find a cure? In
just 5 minutes you can join the world's biggest networked computer and get
us closer sooner. Watch the video.
http://foldingathome.stanford.edu/

--
http://members.chello.nl/hjgtuyl/tourdemonad.html
Haskell programming
--