|Classes of Malik Naik||PHP Breadth First Search||README.md||Download|
This is a task to find the shortest path by visiting all the bins in the warehouse and coming back to the start position in an optimal way.
The graph of the warehouse is as follows:
In the above graph, the green nodes are the aisles and are paths that can be traversed and the white nodes are the bins from which we can pick the items.
To test the working of this code. Clone this repository and then run the following command:
Make sure you have PHP CLI installed before running the above command.
To execute the visualization using Python you need to install the
Then, run the following command to generate the visualization of the Warehouse.