java Traversing a 2D Matrix covering all possible points in java
<p>I have a file containing below matrix information:</p>

<p>3 3</p>

<p>2 0 0</p>

<p>0 0 0</p>

<p>3 0 0</p>

<p>First row represents order of Matrix.
2 -- Start Point
3 -- End point
0 -- a city to be visited
1 -- a city you have no access </p>

<p>Find all possible ways to go from start to end city visiting all 0 nodes and avoiding all 1 nodes. In this case the possible solution is 2.</p>
