On Wed, Oct 15, 2003 at 09:46:37AM -0400, Bhavik Gandhi wrote:
> Hi,
> 
> Does anyone has an idea about,wirting a program for 'undirected graph of 
> integers through its adjacency list, using the depth-first traversal and 
> breasth first traversal' method.

Isn't this covered in any of your college text books :-?

Rich.

-- 
Richard Jones. http://www.annexia.org/ http://freshmeat.net/users/rwmj
Merjis Ltd. http://www.merjis.com/ - all your business data are belong to you.
"One serious obstacle to the adoption of good programming languages is
the notion that everything has to be sacrificed for speed. In computer
languages as in life, speed kills." -- Mike Vanier

-------------------
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