Answer to Question #53964 in Java | JSP | JSF for kaviya

Question #53964

Given a square maze (A) of dimension N, every entry (Aij) in the maze is either an open cell 'O' or a wall 'X'. A rat can travel to its adjacent locations (left, right, top and bottom), but to reach a cell, it must be open. Given the locations of R rats, can you find out whether all the rats can reach others or not.

Expert's answer

Not answered

Comments

No comments. Be first!

Leave a comment

Ask Your question

Related Questions

1.You are given a square matrix of dimension N. Let this matrix be called A. Your task is to rotate A
2.In the Byteland country a string "S" is said to super ascii string if and only if count of
3.I would like to create a simple controller which connects to the database of specific regions based
4.Create array function. Creating photo viewer validNumbers(startNumber, endNumber) - This function
5.Represent a point in time by using an i nt to store the number of seconds since January 1,1970. W
6.1. Represent a point in time by using an int to store the number of seconds since January 1,1970. W
7.1. Represent a point in time by using an int to store the number of seconds since January 1,1970. W