There is a circuit board and we need to find the minimum distance from a point i,j to point x,y
so matrix is like below where b are blocks which you cant cross,and you need to find minimum distance path from point a to point x ,you can move in 4 directions ,east ,west,north and south
o o a o
o b o b
0 x 0 b
but dont you think time complexity will be very high .I tried a DFS with recursion but the time complexity was exponential
@asj177 with BFS complexity is O(E+V), we have mn4 E maximum (in case there are 0 blocks) and m*n vertexes.
Why is complexity exponential? We can also run two BFS simultaneosuly from both point and the first point they meet ,we stop
@elmirap Ok so the approach which I tried was
So lets say with point a we move in 4 directions untill we reach point x.I keep a distance variable which will check if distance is minimum ,there can be many paths to reach the destination ,and had to select the minimum path .So wouldn't there be some kind of DP approach .Whats your view on the same ? With BFS would be do similar ?
@asj177 with BFS you find the minimum path without trying all possibilities, as you do with DFS. I don't see any sense to traverse deep in the graph when you need to find minimum distance to the point
@elmirap Ohh I guess right approach didnt clicke me ...if possible can u plz share the algorithm on how I could have solved this problem .I will help to review my mistake
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.