]> Hi, Does anyone has an idea abt how to wirte a program for 'undirected graph of integers through its adjacency list, using the depth-first traversal and breasth first traversal'. I don't know how to start with it. Any help will be appreciated. Bhavik ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners