[Haskell-beginners] Graph path

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