Matrix Route Algorithm
Matrix
Given a matrix A ‘mxn’ with numbers 0 or 1. Write a program that finds a way from the top row to the botton one by following the neighbour '1'-s. Two '1'-s are called neighbor vertically or horizontally.
Input
Two integers are given, m and n, where 3<=m, n<=25. m shows number of rows, while n shows number of columns.
Output
Show FOUND if there can be found a way. Otherwise show NOT FOUND.
| Input I
|------------
| 3 5
| 1 0 1 1 0
| 0 1 0 1 1
| 1 1 1 0 1
|------------
| Output 1
|------------
| FOUND
|------------
Thank you!!! :D :D
Given a matrix A ‘mxn’ with numbers 0 or 1. Write a program that finds a way from the top row to the botton one by following the neighbour '1'-s. Two '1'-s are called neighbor vertically or horizontally.
Input
Two integers are given, m and n, where 3<=m, n<=25. m shows number of rows, while n shows number of columns.
Output
Show FOUND if there can be found a way. Otherwise show NOT FOUND.
| Input I
|------------
| 3 5
| 1 0 1 1 0
| 0 1 0 1 1
| 1 1 1 0 1
|------------
| Output 1
|------------
| FOUND
|------------
| I have a really complex algorithm in mind nothing simple... I need no solution just a simple algorithm or flowchart. |
Thank you!!! :D :D
Last edited on
perform a flood fill on each cell of the first row, check if at least one cell of the last row is painted.
Topic archived. No new replies allowed.