(***********************************************************************)
(*                                                                     *)
(*  OCaml library from the book ``Apprendre à programmer avec OCaml''  *)
(*                                                                     *)
(*  Sylvain Conchon and Jean-Christophe Filliâtre                      *)
(*  Université Paris Sud                                               *)
(*                                                                     *)
(*  Copyright 2014 Université Paris Sud.  All rights reserved. This    *)
(*  file is distributed under the terms of the GNU Library General     *)
(*  Public License, with the same special exception on linking as the  *)
(*  OCaml library. See http://caml.inria.fr/ocaml/license.fr.html      *)
(*                                                                     *)
(***********************************************************************)

(* Programme 100 page 398
   Parcours en profondeur *)

  let iter_dfs f g s =
    let visited = H.create () in
    let rec visit v =
      if not (H.mem visited v) then begin
        H.add visited v ();
        f v;
        iter_succ visit g v
      end
    in
    visit s

This document was generated using caml2html