-
Notifications
You must be signed in to change notification settings - Fork 0
solve Maze and find the shortest path
License
hussainmansour/Maze-Solver
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
Maps:- --------- Your application should read the description of a map from the file. The file will be structured as follows: ------- • In the first line, you will be given the size of the map which is represented as a 2D grid of size N * M . • In the following N lines, each one will contain M characters representing the i ? th row in the map. • Each character can be ’S’ denoting the start cell, ’E’ denoting the target end cell, ’.’ empty cell where you can move freely, ’#’ denoting a wall cell which means that you can’t move over this cell.
About
solve Maze and find the shortest path
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published