S.D.Mechveliani wrote:
> Zooko Journeyman <[EMAIL PROTECTED]> writes:
> > ...
> >> Honestly, would you use a language which does not allow to
> >> program a depth-first graph traversal in O(n).
>
> > Ah. I didn't realize it was that bad.
> > ...
> > But I've yet to implement a graph structure of any sort (as far
> > as I can remember) and then try to traverse it efficiently.
It's quite possible that you have done it, but just not thought
about the task in those terms. Have you ever used pointers in C or C++?
Any time you use pointers in such a way that there may be cycles,
then you are basically implementing a graph structure, and
efficient traversal is just pointer dereferencing.
Another example of something that is common in C/C++ but which
in difficult to do efficiently in Haskell is hash tables.
--
Fergus Henderson <[EMAIL PROTECTED]> | "I have always known that the pursuit
WWW: <http://www.cs.mu.oz.au/~fjh> | of excellence is a lethal habit"
PGP: finger [EMAIL PROTECTED] | -- the last words of T. S. Garp.
