Title | Maze Routing |
Level | Under Graduate |
Course: | Data Structures |
Summary: | Given a n x n maze, find a path from start to finish by moving either horizontally or vertically without going through the walls. |
Keywords | Maze Routing |
Language: | English |
| |
| |
 |  |
|
|
|
| |
Other Details | |
Last modified on: | 2011-12-21 14:42:22.950429 |
| |
 |
|
|
Credits | |
IDD writer: | Jasveer Singh T. Jethra & Priyadarshan H |
Mentor: | Prof. Saravanan Vijayakumaran |
Developer: | Aruna Adil |
| |
| |
 |
 |
|
 |
|
|
|
|
|
|
|
|
|