- Let
mxn
be amatrix
of 0 and 1 values. - Write the C program that finds the shortest path from
0x0
to mxn point. 1
values in the matrix represents the path, while 0 represents the wall.- So you cannot go to the coordinate or position with 0 value.
- You can move in four directions in total. Up, down, left and right.
-
Notifications
You must be signed in to change notification settings - Fork 0
suhedacilek/shortest_path
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
About
Finding shortest path in maze
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published