Depth First Search (LIFO) - stacked based

[Christinalau]

Hi Everyone, 

Herewith attached my workable Breadth fist search (FIFO) code - queue based. Now, I would like to change to LIFO - stacked based. 

Anyone here can give some guideline on it?

Many thanks.  

[KateB]

Use enqueue data at the opposite end, and normal dequeue will give pretty much the same result as stack.

[Christinalau]

Hi KateB, 

i've just realized that the attached code is queue stacked based which is meaned queued LIFO. What if I want to change to FIFO? what should i change? Any guideline on it? 

[Neos]

use simple enqueue function

[Christinalau]

I've changed it to queue FIFO. but in the end, it won't show a complete path to reach the destination point. However, queue stack LIFO can show a complete path from starting point till the goal point.

Does that means queue FIFO cannot be used in finding a complete path out? Is there any possible way for this method to find its way out? 

Herewith attached queue FIFO. 

[Intaris]

So when is your homework due?

[Christinalau]

Hi Intaris,

On this coming week.