Finding the shortest distance between any two locations one interesting problem often encountered, wide studied and investigated. In a given area while travelling from one place to other, there are places where movement is allowed and places where movement is not allowed. In this paper, we propose a method to find the shortest distance between two places that are a part of a wide spread area, taking into account parts from where the path may not be constructed. © 2014 IEEE.