Get a Free Quote

Solved-Write a function that finds the shortest path through a maze — Project 3- Solution

$35.00 $24.00

Write a function that finds the shortest path through a maze, from start point s to target t, using Breadth First Search. The function declaration is void BFS(int n, int * maze) Here n is the sidelength of the maze, ∗maze is an n × n array representing the maze, with entry 0 representing a…

You’ll get a: . zip file solution

 

 
Categorys:

Description

5/5 – (2 votes)

Write a function that finds the shortest path through a maze, from start point s to target t, using Breadth First Search. The function declaration is

void BFS(int n, int * maze)

Here n is the sidelength of the maze, ∗maze is an n × n array representing the maze, with entry 0 representing a blocked point, entry 1 representing an open point, and entries 2 and 3 representing the start and target points. Your function sets all the entries for fields on the shortest path to 4.

Submit your source code by e-mail to phjmbrass@gmail.com; include the course

(220) and homework number in the subject line, and your name as a comment in the homework file.