-----------------------------------------------------------
New Message on BDOTNET
-----------------------------------------------------------
From: RajDotNet
Message 2 in Discussion
Hi Roshan,
In case its the size of the node thats stopping you
from putting into a queue, u can have a queue of pointers pointing to the
individual nodes.
This way your queue size is
not large.
Or am i missing something.....? Please let me
know
Hope This Helps,
RajDotNet.
----- Original Message -----
From:
spark
To: BDOTNET
Sent: Tuesday, June 17, 2003 3:43
PM
Subject: Breadth First Search
New Message on BDOTNET
Breadth
First Search
Reply
Reply to Sender Recommend
Message 1 in
Discussion
From: spark
Can anyone thinkof any way to do a breadth first search
without using a queue, even some kind of special of the
algorithms.
Suppose you could store some small finite amount of data
per node, but no queue, can we do a BFS ?
roshan
View other groups in this
category.
-----------------------------------------------------------
To stop getting this e-mail, or change how often it arrives, go to your E-mail
Settings.
http://groups.msn.com/bdotnet/_emailsettings.msnw
Need help? If you've forgotten your password, please go to Passport Member Services.
http://groups.msn.com/_passportredir.msnw?ppmprop=help
For other questions or feedback, go to our Contact Us page.
http://groups.msn.com/contact
If you do not want to receive future e-mail from this MSN group, or if you received
this message by mistake, please click the "Remove" link below. On the pre-addressed
e-mail message that opens, simply click "Send". Your e-mail address will be deleted
from this group's mailing list.
mailto:[EMAIL PROTECTED]
