Browse thread
[Caml-list] Undirected Graph Problem...
-
Bhavik Gandhi
- David Fox
- Richard Jones
- Oleg Trott
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | Oleg Trott <oleg_trott@c...> |
| Subject: | Re: [Caml-list] Undirected Graph Problem... |
On Wednesday 15 October 2003 09:46 am, 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. I am novice to OCAML language. Breasts-first traversal? I don't think you can do this in Caml. > 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