# Turtlesim mapping problem

I am new to ROS and I have been given this problem to solve based on turtlesim and graph algorithms- "You will be given a file containing a matrix of 0’s and 1’s. 0’s represent free path and 1’s represent obstacles.In a node,first of all move the turtle sim to the top left corner of the window. Then you have to map the matrix for the turtlesim window and traverse the window avoiding the obstacles, to finally reach the opposite corner of the window. " Can anyone tell me how to map the 0's and 1's in turtle sim window? The input file will have 0's and 1's arranged in a 2d array like this 0 0 1 0 0 0 0 0 1 1 0 0 0

0 0 1 0 0 0 0 0 1 1 0 0 0

0 0 1 0 0 1 0 0 1 1 0 0 0

0 0 0 0 0 1 0 0 0 0 0 0 0

0 0 0 0 0 1 0 0 0 0 0 0 0