Question: Data strcuture course using c++ This is the maze ( read it first ): +---+---+---+---+---+ | | + + + +---+---+ | | | |
Data strcuture course using c++

This is the maze ( read it first ):
+---+---+---+---+---+
| |
+ + + +---+---+
| | | |
+ +---+---+---+ +
| | |
+ + +---+---+ +
| | |
+---+---+ +---+---+
|
+---+---+---+---+---+
Find a path from s to g using the Breadth First Search;
ask the usuer to enter index of the starting point and the end point and then find the path using BDS and print it out.
ex;
+---+---+---+---+---+
S | * * * * |
+ + + +---+---+
| @ | * | * * * |
+ +---+---+---+ +
| @ | @ @ @ @ |
+ + +---+---+ +
| @ @ | @ @ @ |
+---+---+ +---+---+
| @ @ G
+---+---+---+---+---+
+---+---+---+---+---+
S | * * * * |
+ + + +---+---+
| @ | * | * * * |
+ +---+---+---+ +
| @ | @ @ @ @ |
+ + +---+---+ +
| @ @ | @ @ @ |
+---+---+ +---+---+
| @ @ G
+---+---+---+---+---+
Maze BFS 1 Maze BFS 1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
