Abstract

In this paper a two-way searching methodology has been proposed, where simultaneously two searching is being carried out, one from Start node to Destination node and other in reverse direction. The proposed methodology is optimal, complete and runs with a complexity of O(nm/2) . The proposed algorithm has successfully been implemented for solution of land acquisition problem, a burning issue of the country now-a-days, where while selection of path in addition to distance, many other influencing parameters been judged. This methodology takes as input a digitized land bank. To evaluate the efficiency, the methodology been compared with many popular graph traversal algorithms. Key Words: Two-way searching, influencing parameters, land acquisition problem, digitized map, optimal, complete

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call