How to apply BFS in such scenario?

bfs
dynamic-programming
graph
shortest-path

#1

There is one grid

...x..

@.*.X.

.*.*..

where ‘.’ represent visible path, ‘*’ represent check point, ‘@’ represent starting point and ‘x’ represent blocked path.

Now I want to find minimum distance from source to each check point and from each check point to every other check point.

Basically I want to make a weighted complete graph that comprises of all check points and source where weight of each edge is minimum distance between that point to other point.

Refer this problem on spoj for further details.


#2

Your problem is similar to this spoj problem : http://www.spoj.com/problems/A_W_S_N/

You can find it’s solution here : http://codespro.blogspot.in/2015/07/spoj-awsn-happy-valentine-day-valentine.html


#3

@vipsharmavip

I have already mentioned the link to the problem.Can you please explain me the logic.