Design and Search in a Maze

On an office floor , there are e entities - Walls , Cubicles , Coffee Rooms. 

In what data structure we should store this design that when a new member joins the company , the cubicle number which is empty and next closest to any coffee room should be assigned to it. 

Basically , data structure DS.pop() should return that cubicle number in the most efficient way. 

A Person can walk through cubicles to reach a coffee room but not through walls.

http://shirleyisnotageek.blogspot.in/2015/01/the-amazing-maze.html

three ways to design a maze:

• Depth-first search;
• Randomized Kruskal's algorithm;
• Randomized Prim's algorithm;

http://shirleyisnotageek.blogspot.in/2015/01/the-amazing-maze-ii-searching-maze.html

Useful Discussion:
---------------------

http://www.careercup.com/question?id=6495252147863552