🚀 go-pugleaf

Hi there,
	I'm programming something which uses breadthfirst search.
	However when I use the standard breadthfirst I run out of
	local stack. (Who doesn't? ) So I started scouting around
	for a better implementation for this search method.
	I came up with a breadthfirst search with an improvement
	based on using 'the difference-pair representation' for
	the list of candidate paths.
	(It would make concat more efficient.)
	Is there someone out there who knows about this implementation?
	If yes, please enlighten me about it!!!!

Thankx in advance,
		Erwin van Egmond. (erwvegm@cs.vu.nl)


	
--
++ Erwin van Egmond UUCP: ...!mcsun!cs.vu.nl!erwvegm            ++
++								++
++  With a rubber duck, one's never alone		   	++
++	-- "The Hitchhiker's Guide to the Galaxy"		++