* (no subject)
@ 2003-10-15 0:45 Bhavik Gandhi
0 siblings, 0 replies; only message in thread
From: Bhavik Gandhi @ 2003-10-15 0:45 UTC (permalink / raw)
To: caml-list
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
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2003-10-15 0:35 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2003-10-15 0:45 Bhavik Gandhi
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).