Need help with program implementing Breadth-first-search algorithm

Fen A

2018 12 6

0 个回答

2 次查看（30 天）

0 个投票

Hi, I'm trying to figure this problem but I have no idea where to start. I am required to use the Breadth First Search algorithm . Check every pixel next to each other to find the shortest path between a starting point A and a finishing point B, that is going to be entered by the user, in a map .

Inputs are going to be: starting position, finish position, and a binary image of the map.

Outputs are: Matrix containing the path.

Please note: I cannot use any function that will make the code very short and simple. I need to rely , as much as possible, on the most basic commands such as for loops, while loops, if statement, etc. Please Help me!!!

3 个评论
显示 1更早的评论隐藏 1更早的评论

Fen A 2018-12-6

编辑：Fen A 2018-12-6

I haven't gotten any since, I don't know where to start when it comes about checking the pixels next to each other, adding them to a list, checking if the pixel is on the road, check if the pixel has already been checked, and finding the shortest path. Please help me I really need help with this!!!