On Tue, 10 May 2005 06:52:18 -0700, alex goldman wrote: > Lawrence Kirby wrote:
... >> However the original quote was in the context of regular expressions, so >> discussion of the terminology used in regular expressions is far more >> relevant than the terminology used in graph search and optimisation >> algorithms. > > I replied to "And from memory, that is the sort of thing done in Computing > 101 and in Data Structures and Algorithms 101", and I fully explained what > I meant by "greedy" as well. There was no ambiguity. My response talks about relevance, not ambiguity. Lawrence -- http://mail.python.org/mailman/listinfo/python-list
